Use Kruskal’s Algorithm & Prim’s Algorithm to find a minimum spanning tree for each of the following graphs