satisfactory DNF

(a) To build up a little intuition, write down two different formulas in DNF that can be satisfied. Try to make your examples non-trivial/interesting. (b) Write down two different formulas in DNF that can not be satisfied. (c) Now, describe a fast algorithm that decides if a DNF formula can be satisfied. (Your algorithm should be fast, even for formulas with thousands of variables. So you should not build a truth table.) Note: When a problem asks you to describe an algorithm, you are welcome to do so in a number of ways. You should make sure that all of the steps your algorithm performs are understandable and unambiguous. I would recommend using either prose, i.e., paragraphs, or pseudocode, a syntax similar to code without any of the boilerplate, to describe the steps of the algorithm