4. Apply the Pumping Lemma to prove that the following languages are not regular. (a) {akin : n = 2k } (b) {animak: n= m or m #k} (c) {a: n is a product of two primes}