Algorithm Homework

2. Shortest Path. (20 points) You are given the following directed weighted graph G = (V, E): 5 V1 U2 -2 6 -4 VO 8 7 -3 7 2 9 V3 04 (a) (10 points) Use the Bellman-Ford algorithm to determine the shortest path from node vo to every other node. You may use any ordering of the edges. Show all your work including the distance values at the end of every pass. (b) (8 points) Apply Dijkstra's algorithm on graph G with the source vertex as vo. Show all your work. (c) (2 points) State whether the shortest path from vo to vi that you obtained in part (b) is the same as part (a). Explain your