1	(Exercise 5.24, Martin) For the DFAs shown in parts (a), (b) and (c) of Figure 5-5, draw a minimum-state DFA that accepts the same language. Apply Algorithm 5.1 literally.

2	(Exercise 5.30, Martin) Use the pumping lemma (Theorem 5.2a) to show that each of the following languages is not regular. a) L = {0n102n | n >= 0} b) L = {xy in {0,1}* | y is either x or xr}, where xr is the reverse of the string x