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. (i) 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) If each node periodically announces their vectors to the neighbor using the poison-reverse strategy, what is the distance vector advertised in the appropriate period? a) From A to B b) From C to A (6 marks) (iii) If each node periodically announces their vectors to the neighbor using the split horizon strategy, what is the distance vector advertised in the appropriate period? c) From D to B d) From E to B (6 marks) E 3 B 5 7 A 1 7 Fig. Q2