Consider a weighted graph in which all the weights on the edges are distinct. Suppose that e is the edge with the largest weight. What is the property that the graph must have in order for e to be in the minimum spanning tree? Group of answer choices The graph is no longer connected if e is removed. The weight of e must be close to the next largest weight. The edge e must be incident to a vertex of degree 1. The graph must be a tree