urgent solution needed. please solve using C++. detailed explanation of the code would be much appreciated.

In this assignment, you will implement the Kruskal's algorithm for finding the minimum spanning tree from a given graph. MST-KRUSKAL(G,w) 123456789A=foreachvertexvG.VMAKE-SET(v)sorttheedgesofG.Eintonondecreasingorderbyweightwforeachedge(u,v)G.E,takeninnondecreasingorderbyweightifFIND-SET(u)=FINDSET(v)A=A{(u,v)}UNION(u,v)returnA - You must take input from a .txt file. The first line represents the node number and edge number. Rest of the lines represent each edge info. [leftnode rightnode weight] - For sort operation, you can directly use the sort() function from algorithm (C++ stl) library. - For your MAKE-SET, FIND-SET, UNION operations, modify the disjoint set codes as discussed in the class to include union by rank and path compression (following the pseudo codes provided). - In the output, print all the edges of this MST and also print the sum of the edge weights of this MST