Suppose we are given a connected undirected graph with distinct edge weights. We continue to delete the heaviest edge that does not disconnect the graph, until we cannot delete any more edges. Does this strategy always produce a minimum spanning tree of the original graph? Give reasons for your answer