8 7 1 2. 3 9 4 2 11 4 0 8 14 4 6 8 10 7 6 5 1 2 For the given graph, calculate the shortest distance from Node/ Vertex 0 to all the other Nodes using Dijkstra's shortest path algorithm. This Assignment should be submitted Hand Written (pictures taken and uploaded). with students reg number and signature on each page. Show your working Step by Step how you calculated the shortest distance