Please also explain

1, 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 as follows. 12 8 6 8 4 V 12 3 3 4/10 we wood Step N D(t),pt) D(u),p(u) D(V),p(V) D(w),p(w) D(Y), ply) D(z),p(z) 0 1 2 3 4 5 2, 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. 1 Tronto que 102 Roque 3) 2 3 Step 1 Cost to u v X z V From x z Step 2 Cost to u V X z From x Step 3 Cost to u V X z From x z Cost to Step 4 u V y z V From x Z