Question 1 (20 point) For each of the following statements, state whether it is true or false by circling your answer. No explanation is required. 1. If L1 and L2 are regular languages, then L1 U L2 is also a regular language. Answer True/False 2. If F, is a DFA and we Fa. There is exactly one path in the DFA Fa that correspond to w. Answer True/False 3. 1* (01+)* = {w every 0 in w is followed by at least one 1}. Answer True/False 4. 01 U 10 = {01, 10}. Answer True/False 5. The language L = {01k | k >0} is a context free language. Answer True/False 6. The grammar S + is in Chomsky normal form. Answer True/False 7. If L1 and L2 are context free languages, then L1 o L2 (the concate- nation of L and L2) is also a context free language. Answer True/False 8. An NFA must have at least one accepting state. Answer True/False 9. There are non context free languages. Answer True False 10. There are context free languages that's not regular. Answer True False