Give examples of reducing easy problems to hard problems.

   Reduce a simple problem to the halting problem by changing the program to go into an
   infinite loop if a string has the form a^nb^n or to halt if it does not have this form.

Give examples from real problems of problem reductions that go from easy to hard or from NP complete
to NP complete.