A Hamiltonian Cycle in an undirected graph G is a simple cycle that goes through all nodes. A Hamiltonian Path in G is a simple Path that goes through all nodes. Given that the Hamiltonian path problem is NP-Complete, show that the Hamiltonian cycle problem is NP-Complete as well.