ne sooleal) Circuit Problem as in NC " Turn this problems in on Monday March 5. 2. True or False. T = true, F false, and O = open, rneaning that the answer is not known science at this 6)The set of strings that your high school algebra teacher would accept as legitimate expressions The language (e) consisting of just one string, the empty string, is N'P-complete. Warning. time. is a context-free language. Think long and hard about this problem before you answer. It's not as easy as it seems. (ii)The empty language is N'P.complete. Warning. Think long and hard about this problem before you answer. It's not as easy as it seems. (iv)There exists a polynomial time algorithm which finds the factors of any positive integer, where the input is given as a binary numeral. (v)The language consisting of all strings over fa, b) which have more a's than b's is context-free. (vi) 2-SAT is p-TIME. (vii) 3-SAT is p.TIME. (vii)_ Primality is P-TIME. (ix) There is a P-TIME reduction of the halting problem to 3-SAT (x) Every context-free language is in P. (x)--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