2. 6 points) A Hamiltonian path in a graph is a simple path that visits every vertex exactly once. Show that HAM-PATH = {(G, u, v): there is a Hamiltonian path from u to vin G} is NP-complete. You may use the fact that HAM-CYCLE is NP-complete