Consider the $6-$node network shown below, with the given link costs:

a$.$ 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.[2$ pt$]$

b$.$ 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{'}.[2$ pt$]$

c$.$ 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? $[1$ pt$]$