Recall the Traveling Salesman Problem and the heuristics we developed. a) Create a graph where the nearest neighbor heuristic fails. In other words, the final result of the heuristic should not be the shortest Hamiltonian cycle. Create a graph where the 2-opt heuristic fails. In other words, first find a feasible solution on your graph. Then run 2-opt until you get stuck, but the final solution is not the shortest Hamiltonian cycle. Recall the Traveling Salesman Problem and the heuristics we developed. a) Create a graph where the nearest neighbor heuristic fails. In other words, the final result of the heuristic should not be the shortest Hamiltonian cycle. Create a graph where the 2-opt heuristic fails. In other words, first find a feasible solution on your graph. Then run 2-opt until you get stuck, but the final solution is not the shortest Hamiltonian cycle