B B 5 1 2 3 3 A D 3 3 1 E 2 F F 6. Consider the network of the following figure. a. If a link state routing protocol is used for this network, based on Dijkstra's algorithm, compute a tree of shortest paths from router A to every other router in the network. Show all your intermediate steps. b. If distance vector routing protocol is used and the following vectors have just been received at router C, what is C's routing table? From B:(5,0,8,12,6,2); from D: (16,12,6,0,9,10); and from E:(7,6,3,9,0,4). Give both the outgoing line to use and the expected delay