Recall the following definitions (in this problem, all graphs are undirected): HamCycle = {G : G is an unweighted graph with a Hamiltonian cycle} TSP = {(G, k) : G is a weighted, complete graph with a tour of weight k} . Prove that HamCycle p TSP. (Recall from lecture and the handout what such a proof involves.) Since