Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. After using the distance vector algorithm all nodes know the cost of the least cost path in the network, in other words the algorithm has converged. Suppose we have a change of the cost of the link c(v,x) from 3 to 5 and c(x,z) from 2 to 1. Focus only on nodes x and z that want to reach v and write the equations for updating their tables. Can you tell when the algorithm will converge? Only node x & z should be taken in consideration.

6 2 3 3 3