The cost of the circuit is often a factor in work with switching circuits. The circuit you constructed in Problem 52, by using the definition of the conditional, required three gates. Construct a truth table for p → q and ,p ∨~ q. What do you notice about the truth values of the result? Design circuits for p → q by using only one OR-gate and one NOT-gate.

Data from problem 52

The conditional p → q was defined to be equivalent to ∼(p∧ ∼q) . Use gates to represent this conditional.