Answer the following questions on distance-vector routing on the network shown below Routing information to x time slot Initially After first exchange After second exchange 4 distance, next hop distance, next hop distance, next hop 50 (a) Assume that the initial time step corresponds to a step where all computed dis- tance vectors are stabilized. Fill in the values for this row. (b) Assume that poisoned reverse is used. What distance values to node x are exchanged among the remaining routers? (c) Now assume that immediately prior to the beginning of the first exchange (the second row) the link cost between r and y changes to 60. Redraw the table, and fill in the values in the second and third rows assuming poisoned reverse is used Answer the following questions on distance-vector routing on the network shown below Routing information to x time slot Initially After first exchange After second exchange 4 distance, next hop distance, next hop distance, next hop 50 (a) Assume that the initial time step corresponds to a step where all computed dis- tance vectors are stabilized. Fill in the values for this row. (b) Assume that poisoned reverse is used. What distance values to node x are exchanged among the remaining routers? (c) Now assume that immediately prior to the beginning of the first exchange (the second row) the link cost between r and y changes to 60. Redraw the table, and fill in the values in the second and third rows assuming poisoned reverse is used