Problem 1(5+10+10 pts ). Recap the basic routing algorithms in textbook Ch. 5.2 .4 and 5.2.5. Consider the network of routers below, for which we only know the link costs for links D-C and DF as 3 and 5. Answer the following questions from router D's perspective: 1. Can router D use Dijkstra's algorithm to compute the routing table based on the network graph above? Why or why not? 2. Assume distance vector routing is used, and the following vectors have just come into router D: - from C: (12,8,0,10,6,4) - from F:(11,12,6,3,9,0) What is D's new routing table? (*hint: for each destination router, give the outgoing line to use and the cost; similar to the rightmost table in textbook Figure 5-9(b).) 3. Assume link state routing is used, and the following link state packets have just come into router D : What is D's new routing table? (*hint: find the cheapest path to each destination based on the link state packets.)