Answer Happy

Consider the graph from Question 1 again: 12 H This time the goal is, using Dijkstra's algorithm, to find all shortest paths in G, starting from vertex D. Use the algorithm we studied in class to find the distance of each vertex from D. Indicate which edges correspond to the shortest paths. In the small example from above, when determining all shortest paths from vertex C, this looks like: 2 5 A B 4 5 4 1) Upload your solution with the distances from D written next to the vertices, and the edges selected that are needed for all the shortest paths from D to all the other vertices. 2) Answer the following question: Do these selected edges correspond to a minimum spanning tree for G? If yes, why? if not, why not?