MST of a Graph using Prim's Algorithm || GFG Practice

Intuition: The goal of this algorithm is to pick all the smallest edges it can get from the entire graph and then follow the paths coming from that chosen node that has the LEAST weight and following that until all the node have been visited. This is a greedy method in finding the MST of a graph.