Which of the following is true for a simple graph with no cycles?
It must be connected.
It is a forest.
It must have at least one vertex of degree 0.
It is a complete graph.