Using Distributive law, (p→q) ∨ (p ∧ (r→q)) = ((p→q) ∨ p) ∧ ((p→q) ∨ (r→q))
Using Simplification, (p→q) ∨ (r→q) is a conclusion.
(p→q) ∨ (r→q) = (¬p ∨ q) ∨ (¬r ∨ q) = ¬p ∨ q ∨ ¬r = ¬p ∨ (r→q)
Using premises p and ¬p ∨ (r→q) and applying Disjunction Syllogism, the conclusion is (r→q).