COMPSCI 120 Assignment Dijkstra's shortest path This assignment familiarizes you with Dijkstra's shortest path algorithm. To this end, consider the graph depicted below. The edges are weighted, and these weights are given next to the graph. Edge Weight (0.1) 140 (0,4) 240 (0,5) 220 (0,8) 160 (1,4) 210 (2,3) 150 (2.7) 190 (3,4) 190 (4.8) 250 (6,8) 240 1. Follow Dijkstra's algorithm, and write down the minimum distances of each node from node 0. All steps and working must be provided. 2. How many hops are required for the shortest route for each of the reachable nodes? Which is the node that requires the most hops? If there are more than one node, please pick the node with the smallest label. Mark the shortest path that connects this node with node 0. Due 28th of February 2020