In this question, p and q are primitive statements.
(a) Write out the truth table for the compound statement (((∼ p) ∧ q) ∨ p) ∧ q.
(b) Find a shorter compound statement logically equivalent to the statement from part (a). What is the minimal number of primitive statements you need?
(c) Can you make the statement from part (a) a tautology, simply by moving, adding, or deleting parentheses? How? Write out the truth table of your proposed statement to check.
a) True
b) False
