SOLVED: Consider the network shown below with the link costs shown.A) Use the link-state (Dijkstra's algorithm) to compute the shortest path from A to all other nodes. Make sure to show the results of the computation at each step.B) At the end of the computation, what is the corresponding routing table at A?C) Assume that LSA flooding is done synchronously following a single clock. At each clock tick, each node sends its LSAs (if needed) over the appropriate links. An appropriate link for an LSA

What is Dijkstra’s Algorithm? Here's How to Implement It with Example?