Use the pumping lemma to show that the following languages are not regular: {0^n1^n2^n|n greaterthanorequal 0} {ww|w elementof {a,b}*} {1^2^n|n greaterthan 0}