16 Explain why every nonempty propositional clause, by itself, is satisfiable. Prove rigorously that every set of five 3-SAT clauses is satisfiable, provided that each clause mentions discrete, finite domains can be solved in time linear in the number of variables. Are these two facts connected? Discuss.