2. Prove that if G is any connected graph with n vertices with the property that every subgraph of G with n-1 edges is a spanning tree, then G is either a tree or a cycle