1. (12 points) Consider the 6-node network shown below, with the given link costs. 8 0-6 5 5 Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Fill in the following table using the convention shown in Table 5.1 on page 381 in the text Step D(u), p(u) D(v).p(v) D(w),p(w) Dx),p(x)Dy).p(y) D(Z),p(z) 0 4