Question 1. [14 marks] For every single statement decide whether it is true (T) or false (F). Circle the correct answer. 1. A regular language can be recognized by: a deterministic finite automaton, a nondeterministic finite automaton, a pushdown automaton and a deterministic Turing machine 2. The family of context-free languages is accepted by finite automata 3. There are undecidable languages that are produced by context-free grammars 4. Let R be the set of regular languages, let C be the set of context-free languages, and let D be the set of Turing-decidable languages. Then 4.1. DCR 4.2. DnRCC 4.3. RUCCD 4.4. Every language in c is Turing recognizable 5. L = {0" Inn is a positive integer) is 5.1. context-free 5.2. regular 5.3. Turing-recognizable 5.4. Turing-decidable 6. The empty string is accepted by every pushdown automaton. T 7. It is possible to design an algorithm that, when given an arbitrary input consisting of an algorithm A and a language L, whether A decides L. 8. Stephen Cook proved that P - NP