8. (8 pts) 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 similar to Table 4.3 12 8 6 Step N'D(),pDu),p(u) D(v).pv) D(w).p(w) D(y).p(y) D(z).p(z) 4