Question 1 1 pts Let T be an MST of some connected graph G, and let C be a cycle in G. Assuming all edge weights are dis

[answerhappygod]

Question 1 1 Pts Let T Be An Mst Of Some Connected Graph G And Let C Be A Cycle In G Assuming All Edge Weights Are Dis 1 (50.19 KiB) Viewed 21 times

Question 1 1 pts Let T be an MST of some connected graph G, and let C be a cycle in G. Assuming all edge weights are distinct, which of these statements is true? The minimum weight edge in C cannot be in T. The minimum weight edge in C must be in T. The maximum weight edge in C cannot be in T. The maximum weight edges in C must be in T. Question 2 1 pts Let T be an MST of some connected graph G, and let S be a cut in G. Assuming all edge weights are distinct, which of these statements is true? The minimum weight edge in the cutset of 5 cannot be in T. The minimum weight edge in the cutset of S must be in T. The maximum weight edge in the cutset of Scannot be in T. The maximum weight edge in the cutset of S must be in T.