16) Which of the following is not a regular expression? A) (a+b)* + (aa+b) B) (0+1)-(a+b)) (01+11+10) D) (1+2+0)*(1+2) E) None 17) Given the regular expression (a+b+c) (a+b+c) ....n times. The minimum state finite automation that recognizes the language represented by this regular expression contains A ) n states B) n + 1 states C)n + 3 states D) 3*n + I states E) None 18) The language accepted by the following DFA A) Even no of C's and l's B) Odd no of 0's and l's C)Odd no of O' and even no of I's D) None 19) Given the NFA with the following: Which DFA with accepts the same language? A) B) D) None b