Question

Represent each circuit with a symbolic statement. Using a truth table, state whether the circuits are equivalent.





A. (p ∨ q) ∧ ~p; [p ∨ (~p ∧ q)] ∧ ~p; equivalent

B. (p ∨ q) ∧ ~p; [p ∨ (~p ∧ q)] ∧ ~p; not equivalent

C. (p ∧ q) ∨ ~p; [p ∧ (~p ∨ q)] ∧ ~p; not equivalent

D. (p ∧ q) ∨ ~p; [p ∧ (~p ∨ q)] ∧ ~p; equivalent