The count$-$to$-$infinity problem refers to a problem of distance vector routing. The problem means that it takes a long time for a distance vector routing algorithm to converge

when there is a link cost increase. For example, consider a network of three nodes $x,y,$ and $z.$ Suppose initially the link costs are $c(x,y)=4,c(x,z)=50,$ and $c(y,z)=1.$ The result of

distance$-$vector routing algorithm says that $z\text{'}$s path to $x$ is $zyx$ and the cost is $5(=4+1).$ When the cost of link $(x,y)$ increases from $4$ to $60,$ it will take $44$ iterations of running

the distance$-$vector routing algorithm for node $z$ to realize that its new least$-$cost path to $x$ is via its direct link to $x,$ and hence $y$ will also realize its least$-$cost path to $x$ is via $z.$

True OR False