2. If L is a regular language over E, what can be said about the languages L1 = E* – L and L2 = reverse(L*)? A. Li is always regular but not L2. B. L2 is always regular but not L1. C. Li and L2 are...

Extracted text: 2. If L is a regular language over E, what can be said about the languages L1 = E* – L and L2 = reverse(L*)? A. Li is always regular but not L2. B. L2 is always regular but not L1. C. Li and L2 are both regular. 3. What is the language generated by the grammar G: { S → aR , R → aR| baR|b }? A. (aa*b)* B. (a*b)(a*b)* C. (aa*b)(aa*b)* 4. IfL is a regular language over some alphabet E, what can be said about the language L’ = (E* – L) N reverse(L)? A. L' is surely regular. B. L’ is surely non-regular. C. Its type cannot be determined without additional information. 5. Including the trap state, how many states are there in the minimum-state DFA for the regular expression (a+b)*(b+c)* ? Also how many final states will there be in the minimum-state DFA? A. 4 states with one final state B. 3 states with two final states C. 3 states with one final state