True or False. T = true, F = false, and O = open, meaning that the answer is not known science at this

time. In the questions below, P and NP denote P-time and NP-time, respectively.

(x)Every context-free language is in P. (xi)Every context-sensitive language is in P. (xii)Every language generated by a general grammar is recursive (xii)Every language accepted by a non-deterministic machine is accepted by some deterministic machine. xiv)- The proble of whether two given context-free grammars generate the same language is (xv)The problem of whether a given string is generated by a given context-free grammar is (xvi) If G is a context-free gran mar, the question of whether L(G) = 0 is decidable. decidable decidable