Given (p ∧ q), use the Fitch system to prove (q ∨ r) I'm having trouble solving a Fitch Style Proof and I was hoping someone would be able to help me.

Premises: p ∧ q

Goal: q ∨ r

Would be an assumption (p ∧ q => q ∨ r) in first step a correct one? 

Then, q ∨ r Implication Elimination: 2, 1

Why is it not correct?

Thank you very much for any help!
HINT

Your premise says $p \land q$ ... what does this mean in plain English?  It means that both $p$ and $q$ are true. Now: are you interested in $p$ being true? Would $p$ help you to get to your goal $q \lor r$? How about $q$?
Here is a proof using a Fitch-style proof checker:



The first line is the premise. The second line is derived from the premise use conjunction elimination ($\land$E). The last line is derived from the second using disjunction introduction ($\lor$I).



Kevin Klement's JavaScript/PHP Fitch-style natural deduction proof editor and checker http://proofs.openlogicproject.org/