Let HAMPATH be the following problem: Given an undirected graph G, does G have a Hamilton path? Recall that a Hamilton path is one the visits every node exactly once. The HAMCYCLE problem has the same input but is asking whether the graph has a Hamilton cycle. Show that HAMPATH = HAMCYCLE. Note that this is really two questions: HAMPATHM HAMCYCLE HAMCYCLE SM HAMPATH