5. The purpose of Kruskal’s algorithm is to build a minimum cost spanning tree. Give the minimum cost spanning tree of the graph shown below by using Kruskal’s algorithm. (20%)