Consider the network shown below with the link costs shown.
A) Use the link-state (Dijkstra's algorithm) to compute the shortest part 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 is a link where the LSA did not flow before. If all nodes started flooding their LSAs at the same time, how many iterations will it take until flooding is complete?