A graph has a Hamiltonian path. Which of the following must be true?
The graph has an Eulerian circuit.
The graph contains a path that visits every vertex exactly once.
The graph is complete.
The graph has at least nnn edges.