are the following statements true or false? true 1. every forest is a tree. true 2. if a connected graph contains a cycle, then it has at least as many edges as vertices. false 3. every connected forest is a tree. false 4. there is a tree with 20 vertices and 20 edges. true 5. every connected graph contains a spanning tree as a subgrph.