Apply the Pumping Lemma to prove that the following languages are not regular. (a) {akbn:n=2k} (b) {vw:v{a,b},w{c,d},v=w}

Apply the Pumping Lemma to prove that the following languages are not regular. (a) {okbn : n = 2k) (b) {Uw T e {a, e {c, = IWI}