Question 2.23

23. Assuming a graph with E edges and V vertices has a minimum-cost spanning tree T, which of the following statements must be true?

  1. The graph is connected.
  2. The tree T includes every minimum-cost edge.
  3. The tree T has exactly V edges.

23.

a