Apply Dijkstras algorithm to the graph below starting from vertex A. Show the predecessor and distance arrays after each pass of the algorithm.

Problem 2 [10 points]

Apply Prims algorithm to the graph below starting from vertex 1. Show the spanning tree after each edge is added.

25 90 50 15 30 35 70 60 10 50 20