Run the Dijkstra's shortest path algorithm on the graph assigned to you, starting from Vertex 1, and determine the shortest par tree rooted from Vertex 1 to the rest of the Vertices.

Q4: 25 pts) Run the shortest path algorithm on the graph assigned to you, starting from Vertex 1. and determine the shortest path tree rooted from Ver 1 to the rest of the If any edge not have assigned, assume the weight of that edge to be 5. Show your work for each iteration in the skeletal graphs (see next page). For each skeletal graph, indicate the vertices and all the edges that are selected as part of the particular iteration as well as carried over from the previous iterations. Show all the steps