Problem II$\mathrm{.}3.$ Bellman Ford Distance Vector Algorithm $($for computing least cost paths$)(15$ Points$)$

Consider the $5-$node network shown below, with the given link costs.

When the algorithm converges, what are the distance vectors from router $\text{'}W\text{'}$ to all routers? Write your answer as $u,v,w,x,y$

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