I need help with this question and please type in the document!

Consider the network shown in Problem above (3). Using Dijkstras 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.

step N D(v),p(v) D(w),p(w) D(x),p(x) Dly),ply) D(z),p(z) 20 5,0 2,4 8 1 2 3 UX Uxy Uxyv UXyVW UXWVWZ Boy Table 4.3 Running the link-state algorithm on the network in Figure 4.27