Logical Equivalence Question - basic $(p \wedge \neg q) \vee(p \vee\neg q) \Leftrightarrow q\rightarrow p$
I am learning discrete math and I was stuck in this problem for hours.
I tried using De Morgan's law as well as other equivalence laws but I ended up with the same hypothesis.
Is there any advice that I could obtain? Thank you.
DeMorgan's Laws are not required.

Begin with: $~~~(p\wedge\neg q)\vee(p\vee\neg q)$
Associate to: $~((p\wedge \neg q)\vee p)\vee \neg q$
Commute to: $~\neg q\vee(p\vee(p\wedge\neg q))$
...
End with: $q\to p$

All steps are equivalences therefore $((p\wedge\neg q)\vee(p\vee\neg q))\iff (q\to p)$
You can try to use a truth table to find if there is a logical equivalency. However, you should probably try to simplify the left side as (p∧¬q)∨(p∨¬q) is equivalent to (p∨¬q) since any case where (p∧¬q) is true, (p∨¬q) also holds true.