Given a graph G and two distinct vertices, v and w in G, define HAMILTONIANPATH to be the problem of determining whether there is a path that starts at v and ends at w and visits all the vertices of G exactly once. Show that the HAMILTONIAN-PATH problem is NP-complete.