1. 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:
   1. Compute the shortest path from t to all network nodes.
   2. Compute the shortest path from u to all network nodes.
   3. Compute the shortest path from v to all network nodes.
   4. Compute the shortest path from w to all network nodes.

step N D(v),p(v) D(w),p(w) D(x),p(x) D(y),ply) D(z),p(z) 2 3 UX UXY UXYV UXYW UXWVWZ Table 4.3 Running the link-state algorithm on the network in Figure 4.27