A polynomial-time algorithm for a promise problem that takes one of these constructs as input would imply “NP equals RP,” according to the Valiant–Vazirani theorem. The DPLL algorithm takes one of these constructs as input. In 1972, Richard Karp exhibited chains of polynomial-time reductions stemming from a problem taking one of these constructs (-5[1])as input, which was shown by the Cook–Levin theorem to be NP-complete. These constructs can be placed in conjunctive normal form by applying De Morgan’s laws. These constructs’ clauses are restricted to contain at most three literals in a problem abbreviated 3SAT (“THREE-sat”), which asks if there is an input for which these constructs output “true.” For 10 (10[1])points, name these constructs built by using operators like “AND” (-5[1])and “OR” (10[1])to link variables that take (-5[1])the value (10[1])true or false. ■END■ (10[2]0[5])