Here are the weights for the edges in a weighted complete gr

Here are the weights for the edges in a weighted complete graph. The numbers in the table give the weight
of the edge joining each pair of vertices.

a) First use Kruskal’s algorithm to find a minimal spanning tree in this weighted graph.

b) Then use Prim’s algorithm to achieve the same thing.