Minimum Spanning Tree of an undirected weighted graph using Kruskal's algorithm.

1 Project Description In this project, you implement the Minimum Spanning Tree (MST) of a weighted undirected graph, using the Kruskal's algorithm. We consider the nodes in the graph to be numbered from 0 to n - 1. This means a graph with 4 nodes, has nodes named 0, 1, 2 and 3. Each edge has a weight (a positive number of double type) associated with it. You will be implementing the Kruskal's algorithm using Disjoint sets, a well- known data structure for grouping n elements (nodes) into a collection of disjoint sets (connected components) 2 How to Represent a Graph Represent your graph using an adjacency list in which vertices are stored as objects, with every vertex storing a list of adjacent vertices