Consider the network shown in the figure below. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from node v to all network nodes. Show how the algorithm works by presenting your results in the table provided. ( 10 points) \begin{tabular}{|c|c|c|c|c|c|c|c|} \hline Step & N & D(u),p(u) & D(v),p(v) & D(w),p(w) & D(x),p(x) & D(v),p(v) & D(z),p(z) \\ \hline 0 & v & & & & & & \\ \hline 1 & & & & & & \\ \hline 2 & & & & & & \\ \hline 3 & & & & & & \\ \hline 4 & & & & & & \\ \hline 5 & & & & & & \\ \hline \end{tabular}