Are the following languages A and B over the alphabet non-regular? = {a, b, c, d} regular or For a language that is regular, give a regular expression that defines it. For a nonregular language, using the pumping lemma prove that it is not regular. (a) (2 marks) A= {c dkqm+3k | j > 0, k > 0 and m >0} (b) (2 marks) B={a2bk|jk>0}. {b+328+3|r 0 and s>0}