How can I verify logical equivalence without truth table?


I’m trying to prove that this is tautology without truth table, anyone to help me please?
(p ∨ q ) ∧ (⌐p ∨ q)∧ (p ∨ ⌐q ) ∧ (⌐p ∨ ⌐q)