Question: 1. Draw all trees on five vertices.
2. What must be true about the degree sequence of a tree?
3. Suppose a graph G has 364 vertices and 365 edges. Can it be a tree?
4. Suppose a graph G has 28 vertices and 27 edges. Must it be a tree?
5. Suppose a connected graph G with 432,894,789 vertices has no cycles. How many edges might it have?