10. Suppose every edge in an undirected graph has a unique weight. Then there must be a minimum-cost spanning tree that does not include the edge with maximum weight.(A)O(B)X