1. Consider the network in the following figure Use the Bellman-Ford algorithm to find the set of shortest paths from all nodes to destination node 2. Show the set of shortest paths to node 2. Now continue the algorithm after the link between nodes 2 and 4 goes down. a. b. 3 6 2 3 4 2 3 2 5 4 2. Consider the same network as in the first problem. Use the Dijkstra algorithm to find the set of shortest paths from node 4 to other nodes. Draw the spanning tree for node 4. Find the set of associated routing table entries a. b