Find the true statements from the following statements:

1. Each connected graph has a spanning tree
2. The spanning tree of a graph G is a subgraph of G which has all the vertices of G and form a tree
3. Two spanning trees of a graph have the same number of edges
4. All answers are correct