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 y to all network nodes. Show how the algorithm works by presenting your results in the table provided. (10 points) 12 8 7 6 8 3 X 3 4 6 3 W 4 2 Step N' D(t), p(t) D(u), p(u) D(v), p(v) D(w), p(w) D(x), p(x) D(z), p(z) 0 y 7, y ∞ 8, y 6, y 6, y 12, y 1 2 3 4 5 6