Which of the following is true for a tree with nnn vertices and n−1n-1n−1 edges?
It must contain a cycle.
It is always connected.
It can be disconnected.
It has no leaves.