Consider a programming language where variable names must begin with “&” and then contain one or more letters. For simplicity, assume the only letters are “a” and “b”. Write a regular expression to match variable names in this language.

Q2. Construct regular expressions for the following languages. Verify your answer by generating at least one correct string. a. The language over the alphabet (a, b, c) of all three letter words that end in bc b. The language over the alphabet (a, b, c}of all words starting with any number of a's, followed by any number of b's and ending in one or two c's c. The language over the alphabet (a, b, c, d, e, f} where each string starts with a "ab", has either c or d in the middle, and ends with any number of the substring "ef". d. The language over the alphabet (a, b, c) of all words where the words start with either an a or a b followed by as many c's as we want. (the total number or a or b cannot be more that 1) (in any string ther can only be one a or one b) e. The language of only those strings over A= {0, 1} which have exactly 2 zeros