Consider a network with four routers: w, x, y, z. the network includes five links with the following costs: c(x, y)=4, c(x, z)=50, c(y, w)=1, c(z, w)=1, and c(y, z)=3. suppose that the network routers use distance-vector routing. further, the poisoned reverse technique is used to avoid the "countto-infinity" problem.

1. suppose that the routing algorithm has converged. what is the distance vector that each router advertises to every other router?

2. suppose that the link cost between x and y suddenly increases to 60. will there be a "slow convergence" (or "count-to-infinity") problem? how many iterations will be required for the routing protocol to converge?