3 4 marks Are the following languages A over the alphabet = {a,b,c,d} regular or nonregular? For a language that is regular, give the regular expression that defines it. For a nonregular language, using the pumping lemma prove that it is not regular. 1. A = {a4j+255 c2j+1\j > 0 and k > 0} {d3m+1|m >0} Above. stands for language concatenation. Hint: The languages of 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 hte non-regularity of the concatenation. When 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)