Q2. For the network shown in Fig. Q2, distance vector routing is used to determine the forwarding tables of the routers. Assume that all nodes have their time synchronized with each other. Route updates are exchanged in synchronized time step manner at fixed time intervals. Determine the final forward tables of all routers. Assume the router will update its neighbors in order of A, B, C, D, E. (5 marks) E 1 3 B 5 5 7 A 1 7 2 D C Fig.Q2