Use the Pumping Lemma to show the following languages are not regular.

a. {www | w }, = {0, 1}

b. {1 2 n | n 1}, = {1}