1. Dijkstra (8 points) Run Dijkstra's algorithm on the graph below, with source vertex vo (a) Show all the different stages of the algorithm, including d-values for each vertex, the set S, the prioritv queue, the vertex extracted from the priority queue, and the tree edges stored in the predecessor array. Also draw the shortest path tree edges into the graph. U2 0 U2 0 U2 3 5 U3 U3 U3 2 UA U0 U0 2 2 6 6 6 U6 U6 U6 : 0 1 2 3 4 5 0 1 2 3 4 5 6 : 0 1 2 3 4 5 6 3 5 U4 U3 3 5 U4 U3 U3 U4 U0 U0 2 U6 U6 U5 U6 U5 : 0 1 2 3 4 5 6 : 0 1 2 3 4 5 6 : 0 1 2 3 4 5 6 (b) List the shortest paths from vo to all other vertices