Consider the 6-node network shown below, with the given link costs.

Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Show your work in tabular format, as in Table 4.3 in the text.

Nprime	D(u),p(u)	D(v),p(v)	D(w),p(w)	D(x),p(x)	D(y),p(y)	D(z),p(z)
------	--------	--------	--------	--------	--------	--------
u
u w
u w x
u w x y
u w x y v
u w x y v z

2 9 4 $7 2 7