For each of the following problems, decide whether the set A is regular. If the set is regular, give a FSM that recognizes it, if the set is not regular, prove it using the pumping lemma. 1. A- (slls Is E (0 2. A rs 3. A- (w e (a,b Thus the strings 00011000 and 000001100000 are elements of A, but 00100 and 001100000 are not. E A, but 00111100 and 000010 are not. Thus the strings 001100 and 0110000 are elements of w contains at least two a's and at most two b's. 4. A w E (a,b*Tw contains exactly two more a's than b's