Which of the following is true for a tree with nnn vertices?
It has exactly n−1n-1n−1 edges.
It contains at least one cycle.
It is always bipartite.
It is always a complete graph.