A Hamiltonian path is a path that visits every vertex of a graph exactly once. A tournament is a directed graph that has exactly one directed edge between every pair of vertices. Prove that every tournament has either (1) exactly one Hamiltonian path, or (2) a directed cycle with exactly three vertices