Consider the network shown in Figure 2. Suppose that the network uses a synchronous version of DV algorithm, where in each iteration, each node exchanges its distance vectors (computed in the previous iteration) with its neighbors and updates its distance vectors based on the exchanged information. Let D(x) and n(x) denote the distance and the next-hop node to route from node i to node x (i= y, w, z). Sy- 5 39 Figure 2. Example for DV algorithm a) Complete the following table by giving values of D(x) and n(x) to show how DV converges. You need to show all iterations until convergence. How many iterations does it take to converge? (Recall: DV needs an extra iteration after the last distance vector update to inform the neighbors.) source iteration t-0t-1 t=2