Which of the following statements is true about Hamiltonian cycles?
A tree can contain a Hamiltonian cycle.
Every connected graph has a Hamiltonian cycle.
A Hamiltonian cycle must exist in every complete graph KnK_nKn where n≥3n \geq 3n≥3.
If a graph is Hamiltonian, it must be bipartite.