plz i want answer ??

Solve the following problems and submit it as hardcopy on or before the due date 1- Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm and showing your work using a table similar to Table 5.1, do the following: [3 marks] 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