Algebraically find the conjunctive normal form of the following expression. P ⇒ ((Q∧R) ⇔ S) Justify every step with the law (or laws) you use for the step

Make a truth table for the following expression [8]:(a) ¬[(¬p −→ q) ∨ (¬p ∧ ¬q)] (b) Based on your truth table, classify the above expression

Given the function g(x1,..., x4) = m(0, 2, 4, 5, 10, 11, 13, 15), answer the following questions: a) How many possible implicants for g? b) Find all prime implicants. c) Find all essential prime implicants. d) Derive the equivalent logical expression with the minimum number of Literals.

Write the negation of each of the following statements (hint: you may have to apply DeMorgan's Law multiple times) (a) ~ p^~ q (b) (p^q) → r