Prove logical equivalence using laws of propositional logic

Question

$(p \rightarrow r) \vee (q \rightarrow r) ≡ (p\, \wedge \,q) \rightarrow r$

Here is how I started:

$(p \rightarrow r)\, \vee \,(q \rightarrow r) $

$(¬p \,\vee\, r) \,\vee\, ( ¬q \,\vee\, r)\,$ using Conditional Law

Stuck!!!

I can't apply de morgan and associative law for example.

I think there is a problem in question itself.

Answer 1

On the right hand side, $$(p \land q)\rightarrow r\equiv\lnot(p\land q)\lor r\equiv\lnot p\lor\lnot q\lor r\equiv(\lnot p\lor r)\lor(\lnot q\lor r)$$