Question 1 Which of the following statements are True (T) and which of them are False (F) 1. All regular problems (languages) can be solved with any memory-less computational model. 2. The union of the sets of all concatenated context-free languages is also context-free 3. A single tape Turing machine which has two heads is equivalent to the single-tape single head Turing Machine. 4. There are more computational models than computational problems 5. The DFA that accepts the empty language does not exist 6. Every Turing machine algorithm needs and input other than the blank symbol 7. NP-C problems are not solvable in polynomial time 8. If an NP problem A is polynomial time reducible to the acceptance problem ATM, then A can be solved in polynomial space 9. For any Context-free language, we can build a Pushdown automaton (PDA) to accept the intersection of a context free language and its complement 10. Nondeterministic Turing machines are more powerful than deterministic Turing machines