Are the following languages A and B over the alphabet = {a,b,c,d} regular or nonreg- ular? For a language that is regular, give a regular expression that defines it. For a nonregulr language, using the pumping lemma prove that it is not regular. (a) (2 marks) A = {d2j+1,2k+1 | > >k>0} - {ar+242s+3 | * > 0 and 8 >0} (b) (2 marks) B = {a2j+24k+3,32+1 | j > 1, k > 1,2 > 1} {am+3 | m > 1} Above "." stands for language concatenation. Hints: The languages A and B are each expressed as concatenation of two components. If one (or both) of the components is non-regular, this does not imply anything about the non-regularity of the concatenation. If trying to show that a language C is non-regular, we have to apply the pumping lemma to the entire language C (and not to the individual components of the concatenation). On the other hand, if trying to show that is regular, we can find regular expressions for the two components separately and then use the concatenation operation