Which of the following problems is NOT NP-complete?
I. Checking satisfiability of arbitrary Boolean formulae
II. Checking satisfiability of Boolean formulae in conjunctive normal form (CNF /product of sums)
Ill. Checking satisfiability of a Boolean formulae in disjunctive normal form (DNF/sum of products)1
II only
2
III only
3
None of the above
4
I only