Hello, please do just B and C. Thank you

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