Problem 2. Suppose Dijkstra's algorithm is run on the following graph, starting at vertex A 3 6 (a) (25 points) Draw a table showing the intermediate distance values of all the vertices at each iteration of the algorithm. (b) (15 points) Show the final shortest-path tree