8. 113 pts totall Shortest Path edg the table show an initial setup for Dijkstra's shortest path algorithrm ed weighted graph with five vertices (4, B, C, D, and E) and eight edges. Each ith it as shown on the graph. The weights on the vertices (i.e., 0 and o) as well as 25 v known dP 36 You are asked to find minimum-weight paths from source node 'A' to every other vertex in the graph using Dijkstra's shortest path algorithm. (a) [10 pts] Step through the Dijkstra's algorithm and show how the algorithm evolves from the initial setting by filling out the table during each step of the algorithm. Use as many tables as you need. known d P, v known v known d vknown dP