Discrete Mathematics proof by contradiction?

Would you please help me with this. I am thrown off badly by the contrapositions and the contradiction proofs. I don't really understand what it is that I am to do here. Thank You! Given the following premises, construct at proof by contradiction to show that proposition a is true. Premises: (¬b∨c) →a , b→d, c∨¬d