I need help with these two questions, please

5. Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z. 3. Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 4.3. step N Div),plv) D(w),p/w) D(x),p(x) Diyl.ply) D(z).pl) UKW w UxWVWZ 5 Table 4.3. Running the link-state algorithm on the network in Figure 4.27