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 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? Using Bellman Ford algorithmm 10 13 10 4