Problem 1 [6pt] Write down the set of strings recognized by the following regular expressions. If the set is infinite, write down all strings that have 3 or fewer characters. a) (2pt) al|ab|cde) (f|9)) b) (4pt) (aab)*c*