Assume that the distance-vector algorithm runs synchronously following a single clock. At each clock tick, each node exchanges information (DVs) with its neighbors and re-computes its own distance vector values A) Use the link-state (Bellman-Ford's algorithm) to compute the shortest part from B 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 B? How many iterations wil it take until B's distance vector converges? C) If the link directly connecting A and B goes down, and the DV algorithm is using split horizon with poison inverse, how many iterations will it take until B's distance vector converges? Describe your answer briefly. 10 13 10