A CNF proposition ϕ is in 3CNF if each clause contains exactly three distinct literals. (Note that p and ¬p are distinct literals.) In terms of the number of clauses, what’s the smallest 3CNF formula...

A CNF proposition ϕ is in 3CNF if each clause contains exactly three distinct literals. (Note that p and ¬p are distinct literals.) In terms of the number of clauses, what’s the smallest 3CNF formula . . .

1. . . that’s a tautology?

2. . . . that’s not satisfiable?