This assignment continues to explore NP-Completeness and NP-Complete problems. Homework Problems 1. Undirected Hamiltonian Paths (12 pts) 2. Hamiltonian Cycles (12 pts) 3. Making Hamiltonian Paths (11 pts) 4. README (1 point) Total: 36 points Submitting Submit your solution to this assignment in Gradescope hw12. Please assign each page to the correct problem and make sure your solutions are legible. A submission must also include a README containing the required information. 1 Undirected Hamiltonian Paths Prove that UHAMPATH (from lecture) is NP-Complete. Start with the ideas from class. Make sure to include all the required parts of the proof as described in le
This assignment continues to explore NP-Completeness and NP-Complete problems. Homework Problems 1. Undirected Hamiltonian Paths (12 pts) 2. Hamiltonian Cycles (12 pts) 3. Making…