Could I get help in this exercise?

6. CFG and CYK Now consider the following CFG: G={S,B,C},{a,b,c},{SCSBCSaa,Bb,Cc},S (a) Give the (left) derivation starting from S to the word w1=cccaab. Draw the derived tree. (b) Transform this into an equivalent CFG in Chomsky normal form, which does not contain useless symbols. (c) use the CYK algorithm to recognize w1