Question $15(6$ points$)$

Saved

Now consider the distance$-$vector algorithm. Assume that the neighbor nodes calculated the routing information and know the best path to all other nodes. Answer the following: $(1)$ Calculate the distance vector for each question, $(2)$ determine which neighbor is taken for forwarding packets toward the destination. Indicate if there exist a tie for the best cost.

Example: $d_5(v)?$

$d_s(v)=$min$(cost(s,u)+d_u(v),cost(s,t)+d_t(v))=$min$(4+3,1+4)=5,$

Thru $t$ for forwarding packets to the destination $($no tie exists$).$

a$.d_z(t)?$

b$.d_w(y)?$