Question Four: [ ] [5 POINTS]

Consider the following network with the indicated link costs. Use Dijkstras algorithm to compute the least cost path from z to all network nodes. Show how the algorithm works step by step.

Steps	N	D(W)	D(Y)	D(X)	D(V)	D(U)
0 1 2 3 4 5

4 w 6 Z 3 7 9 3 8 |