A boolean formula is in **disjunctive normal form** (DNF) if it

A boolean formula is in **disjunctive normal form** (DNF) if it is a disjunction (OR) of one or more conjunctions (AND) of one or more literals. A literal is a variable or its negation. For example, the formula (x ∧ ¬y ∧ z) ∨ (¬x ∧ z) ∨ (w ∧ y ∧ ¬z) is a DNF formula. In DNF-Sat you are given a DNF formula, and the goal is to tell whether that formula is satisfiable. We claim that the problem DNF-Sat is in P. ~@[](4)

答案：TRUE