QUESTION 77 Consider the network topology shown below with routers labeled A through F, inclusive. Each link is labeled with its "cost" for routing purposes. The link state routing algorithm is used...

Extracted text: QUESTION 77 Consider the network topology shown below with routers labeled A through F, inclusive. Each link is labeled with its "cost" for routing purposes. The link state routing algorithm is used in this network. (a)Show how Djikstra's algorithm works to compute paths from Router E to all other routers (show your answer in a table format similar to the one used in the lectures). (b)Show the final forwarding table at Router E after completion of the algorithm.