a) Use Dijkstra’s algorithm to find all shortest paths from O to
T.
b) Use the algorithm for the minimum spanning tree problem to
determine the minimum spanning tree(s).
c) Assume that the numbers o