How do you find a minimum spanning tree? We will use some Greedy Algorithm called Kruskal’s Algorithm.