I understand that
~(~q ∧ ~r) simplifies down to
(q v r), but I don't understand how the answer to this question is
q v r.
(p v (r v q)), I can simplify it to be
(p v r v q). I thought maybe I could use the Universal Bound Laws or Identity Laws, but neither of the two equations leftover are tautologies or contradictions. Is there a specific property that I'm missing to handle
(p v r v q) ∧ (q v r).