1. Do Exercise 3.1 parts a, c, and d.
2. Give an implementation-level description of a Turing machine that recognizes the language
{ 1n2 : n = 0, 1, 2, ...}.
3. Do Exercise 3.8(b). (See the sample solution to Exercise 3.8(a) on page 191 of Sipser.)
4. Do Problem 3.15(e)
5. Do Problem 3.16(b).
6. Do Problem 4.21.
Extra credit. Do Problem 3.18 or 3.19.