Network costs of each link is given below for route calculation. 3 В 1 1 A D A. Find the sequence of costs and next hops for each destination n from node A, computed by each stage of running link...

The question is mentioned in the picture.

This question is from computer network please solve it.

Extracted text: Network costs of each link is given below for route calculation. 3 В 1 1 A D A. Find the sequence of costs and next hops for each destination n from node A, computed by each stage of running link state algorithm on this graph. B. Let the network has reached a stable state with a distance vector algorithm, and consider the routes to A from the rest of the network. Now assume node A's link to B goes down. Write down a sequence of events that will cause count-to-infinity to happen.