P1.6.1 A compound proposition is said to be in disjunctive normal form or DNF if it is the OR of zero or more clauses, and each clause is the AND of one or more literals. (A literal is a basic proposition or its negation.) For example, (-p^ qArjv (-q ^-r) v (r) is in DNF 0Since there are eight bits in a byte, you need about 240/8 bytes or about 137 gigabytes. This might be barely feasible, but what about 20 or 260 1-42 Any compound proposition is equivalent to one in disjunctive normal form, as we will now (a) Explain how to construct, for any line of a truth table, a clause that is true for that line (b) Illustrate this by giving a clause that is true for the last line of the truth table on four see. and false for all other lines. variables, where p, q, r, and s are all true, and for no other lines (c) Explain how any compound proposition is the OR of clauses of the type you have just constructed. (d) Illustrate this process by giving a DNF compound proposition that is equivalent to