a$)$ Use Djikstra$$s algorithm to find the shortest paths from o to each of the other vertices.

b$)$ Use Prim$$s algorithm to find a minimal spanning tree.

c$)$ Use Kruskal$$s algorithm to find a minimal spanning tree.