Create formal proof with first-order logic

In each of the following, I need to assess whether the argument is valid. If it is, I need to give a formal proof with first-order logic. 1. P→(Q∧R) from the premises (P→Q)∧R, (P∧R)→S, and ¬S. 2. P→(Q∧R) from the premises P∧Q, Q→¬R, ¬P, ¬R→S. 3. ¬T from the premises Q∧S, (Q∧¬P)→¬R, Q→¬P, (S∧T)→(PvR). I have attached examples on how other arguments were proven.