Which of the following is true about a tree with nnn vertices?
It has n−1n-1n−1 edges.
It contains at least one cycle.
It is connected.
Every edge is a bridge.