Questions Consider the following network. The numbers on links between the nodes represent the costs corresponding to using these links. B 4 D 1 6 1 A 5 2 F F 4 3 7 E 1 6 G 3. Show the operation of Dijkstra's (Link State) algorithm for computing the least cost path from 'E' to all other nodes by completing tables below. (20 points) L(E) Visited node L(B) L(C) L(D) L(A) L(F) L(G) 0 00 oo 00 OO 00 00 Node Previous Node Shortest distance from 'E' 0 E B C D A G F