$(18$pts$)$ Consider the following network. With the indicated link costs, use Dijkstra's shortestpath algorithm to compute the shortest path from $x$ to all network nodes. b$)$ use distance$-$vector algorithm and show the distance table entries at node x after initialization iteration, first iteration and second iteration.

a$)$ Dijkstra's algorithm

$\backslash$table$[[$Step$,N^{\text{'}},D(u),p(u),D(v),p(v),D(w),p(w),D(y),p(y),D(z),p(z)$