(Solved): Assignment - CS120 Dijkstra's algorithm Consider the graph shown below. The edge weights are indica ...

Assignment - CS120 Dijkstra's algorithm Consider the graph shown below. The edge weights are indicated next to edges the graph. 3 4 Edge Weight 270 230 (0,4) 180 (0,6) 150 (2,4) 200 (2,5) 290 (5,6) 250 Due 1st of July 2022. (0, 1) (0, 3) 1. Write down the minimum distances of each node from node 0. following Dijkstra's shortest path algorithm. Provide all steps and workings. 2. How many hops are required for each of the reachable nodes to be reached? Which node has the greatest number of hops? If more than one node exists, choose the one with the smallest label. Mark the shortest path between this node and node 0.