Consider the network shown in the figure. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path.

Show you work using a table similar to Table 5.1, do the following:

Compute the shortest path from t to all network nodes.

Compute the shortest path from u to all network nodes.

Compute the shortest path from v to all network nodes.

Compute the shortest path from w to all network nodes.

Compute the shortest path from x to all network nodes.

Compute the shortest path from y to all network nodes.

Compute the shortest path from z to all network nodes.

12 3 3