Select all correct statement$($s$)$ about the algorithm below. Note the distance vectors of any node to all routers in this network are written as $($u$,$v$,$w$,$x$,$y$).$

The initial distance vectors of router U are $($u$,$v$,$w$,$x$,$y$)=(0,4,$$,$$,$$).$

When link cost between node V and node X is decreased by $3,$ the phrase 'Good news travels fast' is very applicable to distance vector routing.

When link cost between node V and node W is increased by $3,$ the problem of 'Count to Infinity' can occur.

When the algorithm converges the distance vectors in router Y are $($u$,$v$,$w$,$x$,$y$)=(10,6,1,2,0).$

The initial distance vectors of router X are $($u$,$v$,$w$,$x$,$y$)=($$,4,1,0,2).$