QUESTION $30$

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

$2$ points

$$

The least cost from node $x$ to node $a$ is $$

The least cost from node $x$ to node $b$ is $$