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. )Every language generated by an unambiguous context-free grammar is accepted by some DPDA (ii)The languc"d 20 is recursive (iii) Let L be the language over (a, b, c) consisting of all strings which have more a's than b's and more b's than e's. There is some PDA that accepts L (iv) The language {a"b"en I n 0} is in the class P-TIME. There exists a polynomial time alorithm which finds the factors of any positive integer where the input is given as a binary numeral Every undecidable problem is NP-omplete. The language {a"b"l n > 0} is context-free. The language fa"b"e" n 2 0 is context-free. (vii) (ix)The language fa'be*lj-i +k is context-free The intersection of any three regular languages is context-free