For each of the languages listed below, give a regular expression that generates the lan- guage. Briefly justify your answer. (a) The set of strings over (a, b such that any a in the string is followed by an odd number of b's. Examples: bbbab E L, but abb f L. (b) The set of strings over fa, b in which there is an a in every even position and the total number of b's is odd, where the first symbol is considered to be in an odd position. Examples: aabaaaa E L but ab L. (c) The set of strings over fa, b) containing no more than three a's in a row. Examples: bbabaaabb E L, aaaab f L