Problem $5$:

Consider the network shown in Figure $2.$ Initially, each node only knows the costs of the links to each of its own neighbors. Based on the distance$-$vector algorithm, show the initial routing tables for each of the nodes $u,v,x,y,$ and $z.$

Figure $2$: Figure for Problem $5.$