Consider the network fragment shown below. x has only two attached neighbors, w and y$.$ w has a minimum$-$cost path to destination u $($not shown$)$ of $5,$ and y has a minimum$-$cost path to u of $6.$ The complete paths from w and y to u $($and between w and y$)$ are not shown. All link costs in the network have non$-$negative integer values.

Give x$\text{'}$s distance vector for destinations:

D$($w$)=$

D$($y$)=$

D$($u$)=$

What are the minimum link cost changes to c$($x$,$y$)$ or c$($x$,$w$)($but not both$)$ such that x will inform its neighbors of a new minimum$-$cost path to u as a result of executing the distance vector algorithm? Give the new link costs, not the changes.

new c$($x$,$y$)$:

new c$($x$,$w$)$: