1: (6 points) a) (2 points) Select one of the choices that best suites the given statement 1) What is the regular expression for the language set strings with at least one 1, one 2 and one 3? 1+2+3 (D) Both A) and B) B. 11* 22* 33* C. 1* 2 * 3 2) The regular expression (011) *00 will accept all strings a) Divisible by 2 b Divisible by 4 d) Divisible by 4 with minimum length 2 3) The set of all strings over (a, b) of even length is represented by the regular expression (a) (ab + aa+bb+ba)* (b) (a + b)*(a* + b)* (c) (aa+bb)* (d) (ab+ba)* 4) Which of the following is a regular expression for the language of all strings over the alphabet {0, 1} that contain at least one 0 and at least one 1? c) Divisible by 2 with minimum length 2 a)(0+1)0(0+1) b)0(0+1)*1 c)1 (0+1)*0 0(1+0)*1 5) Which of the following is a context free grammar for the language of all strings over the alphabet {a, b} that contain an odd number of a's and an even number of b's? as- -> aSb | bsa | 2 b)S-> aSb | bSa c)S-> aa | bb d)S -> 2 6)