Consider the network shown below with indicated link costs.

The complete paths from W and Y to U $($and between W and Y $)$ are not

shown in the figure. W has a minimum$-$cost path to U of cost $5,$ and Y

has a minimum$-$cost path to U of cost $6.$ All link costs in the network have

strictly positive values. Nodes in the network are executing the distance$-$vector

algorithm. Suppose the algorithm has converged.