Apply the Pumping Lemma to prove that the following languages are not regular.

, = IWI}