Using both Pumping Lemma and Equivalence class techniques prove that following languages are not regular

Using both Pumping Lemma and Equivalence class techniques prove that following languages are not regular A_1 = {0^n 1^n 2^n | n greaterthanorequalto 0} A_2 = {www|w belongs to {a, b}*} A_3 = {a^2n|n greaterthanorequalto 0} (here, a^2^n means a string of 2^n a's.)