Kruskal_Algo_1 This question relates to the use of the Graph Abstract Data Type (ADT) implemented with an Adjacency Map, as covered in class. You are working with an undirected, connected, weighted graph G, where all edges have non-negative weights. The goal is to compute a Minimum Spanning Tree (MST) of G. The following pseudocode implements Kruskal’s Algorithm using a priority queue to select edges in increasing order of weight and a disjoint set forest to track connected components: KRUSKAL-MST(Graph G):    Initialize an empty list MST to store edges of the minimum spanning tree    Initialize a priority queue PQ with all edges of G, prioritized by weight    Initialize a forest where each vertex is its own component     while MST has fewer than (number of vertices - 1) edges and PQ is not empty:        Remove the edge with the smallest weight from PQ        Let (u, v) be the endpoints of the edge         if u and v are in different components:            Add edge (u, v) to MST            Merge the components of u and v     return MST Why do we remove the edge with the smallest weight at each step? 单项选择题