A Minimum Spanning Tree (MST) of a weighted graph G(V, E) is a tree obtained by removing some edges in G such that the sum of the weights of the resulting tree's edges is as small as possible. In this