Part A;
Part B;
Part C;
DeMorgan’s Laws: (negating AND and OR)
(The statements shown are logically equivalent.)
∼(p ∧ q) ↔ (∼p ∨ ∼q)
∼(p ∨ q) ↔ (∼p ∧ ∼q)
Notice that the negation symbol is distributed across the parentheses and the symbols are changed from AND to OR (or vice versa).