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.

Turn this problems in on Monday March 5 True or False. T = true, F-false, and 0 : open, meaning that the answer is not known science at this time 2 (i)The set of strings that your high school algebra teacher would accept as legitimate expressions (ii)The language (e) consisting of just one string, the empty string, is NP-complete. Warning The empty language is N'P-complete. Warning. Think long and hard about this problem is a context-free language Think long and hard about this problem before you answer. It's not as easy as it seems 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 (a,b) which have more a's than b's is context-free (vi) 2.SAT is P.TIME. (vii) 3-SAT is P-TIME. (viii) Primality is p.TIME. (ix)--There is a P-TIME reduction of the halting problem to 3-SAT