Please explain the answer step by step, as im so confuse how to get the answer. Thankyou!

initially, we have the following distance vectors for the network below:

Distance vector of y: $(5,0,2)$

Distance vector of z: $(7,2,0)$

Now the link cost of y$-$z changes from $2$ to $33.$ Using Distance Vector routing algorithm, write down the steps showing that how node y and node z update their distance vectors until the routing algorithm converges.