8 3 6 8 8 4 2 3 3 4 6 3 3 w step N D(v),p(v) D(x),p(x) Dlyply) D(2),p(z) D(w),p/w) 5,u 1,0 00 00 2,0 2,0 2,0 2x OD 0 1 2 3 4 5 48 UX UXY UXY UXyVW uXyz 4, 3, 3, 4,8 Table 4.3. Running the link-state algorithm on the network in Figure 4.27 Consider the network shown in Problem above (3). Using Dijkstra's algorithm, and showing your work using a table similar to Table 4.3, do the following: a. Compute the shortest path from t to all network nodes. b. Compute the shortest path from u to all network nodes. c. Compute the shortest path from v to all network nodes. d. Compute the shortest path from w to all network nodes. e. Compute the shortest path from y to all network nodes. f. Compute the shortest path from z to all network nodes