For the network shown below give global distance-vector tables like those in the textbook when. -Each node knows only the distances to its immediate neighbors. - Each node has reported the information it had in the preceding step to its immediate neighbors. -Step (b) happens a second time. 5 A B E 3 3 F 2 Consider the network from the previous problem running distance-vector routing has already achieved convergence. At some time, link B-C fails. - Give the routing tables at A and D after B and C have reported the news. Give the routing tables at A and D after their next mutual exchange. For the network shown below give global distance-vector tables like those in the textbook when. -Each node knows only the distances to its immediate neighbors. - Each node has reported the information it had in the preceding step to its immediate neighbors. -Step (b) happens a second time. 5 A B E 3 3 F 2 Consider the network from the previous problem running distance-vector routing has already achieved convergence. At some time, link B-C fails. - Give the routing tables at A and D after B and C have reported the news. Give the routing tables at A and D after their next mutual exchange