1. 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) 12 7 8 2 3 4 Step D(w), N' D(t). p(t) D(u), p(u) D(x), p(x) Dy), ply) D(z), p(z) p(w) 0 V 1 2 3 4 5 9