I need help with this question, please.

stap Diva Dwo/w) D.) Dylalyl Delplil 2 3 4 52 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 Dijlestra'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 1. Compute the shortest path from z to all network nodes