$2)$ Bellman Ford distance vector algorithm $($for computing least cost paths$)$ Consider the $5-$node network shown below, with the given link costs.

When the algorithm converges, what are the distance vectors from router $\text{'}$ X $\text{'}$ to all routers?

Write your answer as u$,$v$,$w$,$x$,$y

What are the initial distance vectors for router $\text{'}$ Y $\text{'}?$ Write your answer as u$,$v$,$w$,$x$,$y and if a

distance is oo$,$ write $\text{'}$ x $\text{'}$

The phrase 'Good news travels fast' is very applicable to distance vector routing when link

costs decrease; what is the name of the problem that can occur when link costs increase?

Answer all questions will give rating!