Java

Problem 1 4 2 6 4 3 2 4 Figure 1: A Weighted Digraph 1. Trace the action of Dijkstra algorithm in finding the shortest paths from vertex 2 to every other vertex in the digraph in Figure 1 by giving the initial contents of the dist, pred and seen arrays and their contents after each vertex is seen. 2. Using the final contents of those arrays, give the shortest path and distance from vertex 2 to 4. Explain how you obtained them from the arrays