discrete mathematics proofs: please show all steps, thanks

Problem 1 (11 pts.) Use a proof by contradiction to show that there are not integers c,d such that c3 mod 4 , d=2mod6, and c(d+1) is not divisible by 3 . Note. The purpose is to practice proof by contradiction, so do make sure you are able to negate the claim properly before attempting a proof. See Week 2's video on proof by contradiction and Tutorial 3 for examples