True or False. If the question is currently open, write "O" or "Open"

(o) The halting problen is recursively enumerable. (p)The complement of every context-free language is context-free. ()No language which has an ambiguous context-free grammar can be accepted by a DPDA The union of any two context-free languages is context-free. The question of whether a given Turing Machine halts with empty input is decidable. The class of languages accepted by non-deterministic finite automata is the same as the class (t) of languages accepted by deterministic finite automata. (u) The intersection of any two regular languages is regular. (v) The intersection of any two context-free languages is context-free (w)If L1 reduces to L2 in polynomial time, and if L2 is NP, then Li must be NP () Let F(0) = 1, and let F(n) = 2F(n-1) for n > 0. Then F is recursive. (v). Every language which is accepted by some non-deterministic machine is accepted by some