Which of the following properties must be true for a tree with nnn vertices?
It contains at least one cycle
It has exactly nnn edges
It is connected
It has n−1n-1n−1 edges