B 25 17 6 3 22 P1) (50 pts) Step through Dijkstra's Algorithm to calculate the single source shortest path from node A 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. D E C 43 3 20 D Node Initial Distance/ Distance Predecessor Finished? (Y/N) Figure / Directed Graph A B OU D E