Consider the network topology in Figure 2. (a) (15 points) Starting from node A, calculate the shortest path from A to every other node using Dijkstra's shortest-path algorithm. Use the below table "a" and show the values in each column at each iteration (i.e. each time you add a node to the converging network). In each cell of the table, write the total cost to reach the node and the list of nodes to traverse in order to reach that node. (b) (15 points) Now use table "b" but this time start from node D and calculate the shortest path from D to every other node using Dijkstra's shortest-path algorithm. Show your work at each step (just like part a). F H B D 0 E Figure 2: computer network topology