In this problem, we will seek to prove that the language A={0i1j2ki,j,k0 and if i=1 then j=k} is not regular. However, we cannot apply the pumping lemma directly. - (10 points) Prove that the related language B={01n2nn0} is not regular using the Pumping Lemma. - (5 points) Argue that A is not regular using closure properties of regular languages. Hint: The language C={xx begins with one 0} might prove to be useful. 3: Regex and Pumping Lemma-1 - Bonus (3 points) Explain why the pumping lemma cannot be applied to A directly