Q. Consider the tollwirg rietwo: Al liik osts are 1. The network uses adistc vetor routing algorithri a. Suppose Split Konzen with Pnis'n Reverse has been implemented in this network. Suppose link B D fails. Show how the content of the routing tables at each node before and after fa ilure for interval, and discuss houw many updates it would take unti the routing tatles converge. (15 marks) b. Suggest a method to soe the counting to infinity prblern in part a every updata