The Bellman-Ford algorithm correctly finds shortest paths if there is no negative weight cycle reachable from the source. The following show its pseudocode assuming that is the case. A....

Extracted text: The Bellman-Ford algorithm correctly finds shortest paths if there is no negative weight cycle reachable from the source. The following show its pseudocode assuming that is the case. A. Bellman-Ford(G, w, s) 1. Initialize-Single-Source(G, s) 2. for i = 1 to |G.V| – 1 3. 4. for each edge (u, v) E G.E Relax(u, v, w) Explain why the algorithm works. Particularly, regardless of in which order edges are relaxed in an arbitrary order in lines 3 and 4.