Questions Consider the following network. The numbers on links between the nodes represent the costs corresponding to using these links 4 s 2 E 1. Show the operation of Dijkstra's (Link State) algorithm for computing the least cost path from 'A' to all other nodes by completing tables below. (20 points) L(A) L(B) L(C) L(D) ) L(F) Visited node L(G) 0 OO DO 8 Node Previous Node Shortest distance from 'A' 0 A B D E G F 2. From the results above, show the shortest path between node 'A' and all the other nodes: (10 points) Shortest path between 'A' and 'B': Shortest path between 'A' and 'C': Shortest path between 'A' and 'D': Shortest path between 'A' and 'E': Shortest path between 'A' and 'F': Shortest path between 'A' and 'G