1 / 2 - 100% + All students agree, individually and collectively, never to give or receive unpermitted aid in examinations or other work that is to be used by the instructor as a basis of grading. Signature: B 25 17 22 C A 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. E 43 3 20 7 D Node Initial Distance/ Distance Predecessor Finished? (Y/N) Figure 1 Directed Graph A B I D E List the shortest path from A to E? Is this the only path with the same distance? if not, list another solution