1.Consider a complete graph G with 4 vertices. The graph G has ---- spanning trees. 2. Consider a undirected graph G with vertices { A, B, C, D, E}. In graph 6, every edge has distinct weight. Edge CD...

Extracted text: 1.Consider a complete graph G with 4 vertices. The graph G has ---- spanning trees. 2. Consider a undirected graph G with vertices { A, B, C, D, E}. In graph 6, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false? a) Every minimum spanning tree of G must contain CD 6) IF AB is in a minimum spanning tree, then its removal must disconnect 6 c) No minimum spanning tree contains AB d) G has a unique minimum spanning tree