E 7 4 9 2 9 7 1 B D F P3) (20 pts) (Greedy Algorithms- Dijkstra) Consider the following graph: a. (12 pts.) Step through Dijkstra's Algorithm to calculate the single source shortest path from node G to every other vertex. You must show your steps in the table below for full credit. Show your steps by crossing through values that are replaced by a new value. Break ties by choosing the lowest letter first; ex. if B and C were tied, you would explore B first. 6 3 1 7 2 G ( 8 10 Initial Distance Distance Predecessor Node A B D E F IO 1 b. (5 pts.) List the shortest path from G to H? Is this the only path with the same distance? if not, list another solution. c. (3 pts) If we change the weight of the path between D-H to be -1 instead of 1. After applying Dijkstra, Will the shortest path from G to H change? Explain your