Problem 1 Consider the network shown in Figure 1 Use Dijkstra's algorithm to compute the minimum-cost paths from c to all the nodes. You need to show the steps by giving a table as shown in class. Give the resulting routing tree from c. Give the resulting forwarding table at c( in class). a) b) 1 10 7 Figure 1. Example for Dijkstra's algorithm