All questions Solve 1.2.3.4

FIRST QUESTION (Choose the correct answer 1)The language L = [Wab: W eta, b,c)" ) denotes the set of all strings on {a,b,c) A) ending in ab B) ending in aab C) ending in bab D ending in bab or aab E)None 2) The Language accepted by the finite automata 0,1 0,1 A) (0+*100+11)(0+1)* B) (0+1)%00+11)(0+1) Cp (0+1)*(00+1170+1)*+ D) None 3) Let = {a}. The complement of the language accepted by the following NFA E)None ) B) {a, 2.) 9** D) { 23 4) The following NFA accepts the language the set of strings on (a,b) a,b b b C) not containing bb D) None A) containing bb B) ending in bb