i need help with these questions please.

b. Compute the shortest path from u to all network nodes. c. Compute the shortest path from v to all network modes. d. Compute the shortest path from w to all network nodes. e. Compute the shortest path from y to all network modes. f. Compute the shortest path from z to all network nodes. 5. Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector a rithm and show the distance table entries at nodex. step Dv.pl wale) .pl) Dylpy! Dzl.pl) S 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. 1. Looking at Figure below, enumerate the paths from y to u that do not contain any loops. There are many. 2. Repeat Problem 1 for paths from x to z, z to u, and z to w. 3. Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 4.3