I really need help with this.

step N Div),p(v) D(w),p/w) D(x),p(x) Dly),ply) D(z),p(z) iza 83 OU 1 UX 2 Uxy UXYV UXYVW UXWVWZ Table 4.3.Running the link-state algorithm on the network in Figure 4.27 4. 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