1) Use Djikstra's Algorithm (implemented manually, not as a program) to determine the shortest path from node A to every other node in the undirected graph shown at right, where each edge is labeled with its weight 18 16 17 For each iteration of the algorithm, (i) list the node settled, the total path length, and edge added and (ii) update the values in the DIST array. Draw the final tree showing the shortest paths from node A to every other node. 12 25 20 16