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.

(xxii)_ The traveling salesman problem (TSP) is NP-complete xxiv) The knapsack problem is NP-complete. (xxv)A Boolean erpression is defined to be an expression of Boolean type, where all the variables are identifiers of type Boolean, and the operators permitted are not, and, or, ies. A Boolean expression is said to be satisfiable if it is not a contradiction. For example " and not is a contradiction, but "z and not y" is satisfiable, because could be true and y could be false. The class of all satisfiable Boolean expressions is N'P-complete. xxvi)- The Boolean Circuit Problem is in P. (xxvii)_ The Boolean Circuit Problem is in NC