Problem
1. Show that if a problem is not in NP, it is not NP-easy. Therefore, Presburger Arithmetic and the Halting problem are not NP-easy.
2. Implement the approximation algorithms for the Traveling Salesperson problem, run them on your system, and study their performances using several problem instances.
3. Write a detailed algorithm of the approximation algorithm for the Bin-Packing problem given in Section 9.5.2, and show that its time complexity is in Θ(n2).