QUESTION $31$

$2$ points

Consider the DV routing scenario shown below with the costs CxU$=5,Cxv=8,$ and $Cxw=6.$ The respective minimum distance vectors from $(u,v,w)$ to $(a,b)$ are: $Du(a,b)=(6,10),Dv(a,b)=(7,7),$ and $Dw(a,b)=(11,11).$ Compute the least cost from node $x$ to node a and the least cost from node $x$ to node $b.$

The least cost from node $x$

to node $a$ is $$

The least cost from node $x$

to node $b$ is $$H