Write a C function that finds a minimum cost spanning tree using Kruskal's algorithm. Input Format The first line shows V and E. V represents the vertex number while E is the edge number. The rest shows the edge detail. Each line contains s, t and c, which means there is an edge between s and v with cost c. Output Format The output consists of one number, C. It represents the sum of all edge cost in the minimum spanning tree in terms of the given graph. Constraints 1 < V 106 v-1Emin((V-),2 106) 1