Show that the following problem is in NP:

Input: A graph G < V, E > and a path a[] is given

Output: TRUE if and only if the give path a[] is a Hamiltonian cycle. (A Hamiltonian cycle is a graph cycle that visits each node exactly once)