Consider the network shown in Figure 1. a) 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. b) Give the resulting routing tree from c. c) Give the resulting forwarding table at c (each entry has fields "destination" and "link" as shown in class). 10 1 1 8 3 C 3 7 d 1 3 1 2 2 Figure 1. Example for Dijkstra's algorithm Activate Win Go to Settings to