1) Used Dijkstra's algorithm to find the shortest path between node 1 and every other node of the following weighted graph. You must use all the data structures (Parent, T, X). Using the parent array, reconstruct the shortest paths between 1 and every other node. (20)