Let G be a weighted undirected graph and e be an edge with mazimum weight in G. suppose there is a minimum weight spanning tree in G containing edge e. which of the following statements are always true?
A) There exists a cutset in G having all edges of maximum weight
B) There exists a cycle in G having all edges of maximum weight
C) Edge e cannot be contained in a cycle
D) All edges in G have the same weight