Use the pumping lemma to prove (write full proofs) that the following languages are not regular. 1. {ambcm+nm 0 and n 0} 2. 2n {a | n 0}