Show that ( ∧ ¬) ∨ ( ∧ ) and ( → ) ∧ are logically equivalent using a sequence of equivalences (not a truth table)