Consider the network fragment shown below. $x$ has only two

attached neighbours, $w$ and $y.$ The complete paths from $w$ and $y$

to $u$ are not shown.

Answer the following questions $($note$,$ each question is

independent of other questions$)$:

A$.$ In the above figure, what is the distance vector of $x$ to

destination $U,$

$D_x(U)=$

B$.$ In the above figure, if the link cost between $x$ and $W$ is now

$6,$ calculate:

$D_x(U)=$

C$.$ In the above figure, if the link cost between $Y$ and $W$ is now

$2,$ calculate:

$D_y(U)=$