Consider a four$-$node topology and the link costs are $c(w,x)=3,c(x,y)=2,c(y,z)=7,c(z,w)$

$=8,$ and $c(x,z)=4.$

Assume that each node initially knows the costs to each of its neighbors. Compute the distance table

after the initialization step and calculate the step$-$by$-$step distance table entries of each node using the

distance vector routing algorithm for the first $3$ timestamps only.

Suppose that the link cost between node $w$ and node $x$ increases to $70.$ Will there be a count$-$to$-$infinity

problem? Explain.