Consider the following figure of a sample network and its four columns showing the delay $($distance$)$ vectors received from the neighbors of router J$.$ A$,$ for instance, claims to

have a $12$msec delay to B$,$ a $25$msec delay to C$,$ a $40$msec delay to D$,$ etc. Suppose that J has measured or estimated its delay to its neighbors, A$,$ I, H$,$ and K$,$ as $8,10,12,$ and $6$

msec, respectively. Consider how J computes its new route to router G$.$ It knows that it can get to A in $8$msec, and furthermore A claims to be able to get to $G$ in $18$msec, so J

knows it can count on a delay of $26$msec to $G$ if it forwards packets bound for $G$ to A$.$ Similarly, it computes the delay to G via I, H$,$ and K as $41(31+10),18(6+12),$ and $37(31+$

msec, respectively. The best of these values is $18,$ so it makes an entry in its routing table that the delay to $G$ is $18$msec and that the route to use is via $H.$

Perform the same calculation for all the other destinations and give the cost as values of the new routing table $($distance vector$)$ of router $J$ to the destinations $($A $-L)$ by matching

them below to their entry values.