$33-$A$)$ When the algorithm converges, what are the distance vectors from router $\text{'}$ X $\text{'}$ to all routers? Write your answer as $\backslash ($ u$,$ v$,$ w$,$ x$,$ y $\backslash )(2$ points$)$

$33-$B$)$ What are the initial distance vectors for router $\text{'}$V$\text{'}?$ Write your answer as $\backslash ($ u$,$ v$,$ w$,$ x$,$ y $\backslash )$ and if a distance is $\backslash (\backslash$infty $\backslash ),$ write $\text{'}\backslash ($ x $\backslash )\text{'}(2$ points$)$

$3-$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? $(2$ points$)$