Using the Pumping Lemma for regular sets show that the following languages are not regular:

l. {0ⁱ1^j0ⁱ | i,j >= 0}

2. {uvu | u,v {0, 1}⁺}

3. {www | w {a,b}⁺}