if you are unwilling to answer all 4 parts, just answer part c.

Problem 4.3: Give a context-free grammar (CFG) for each of the following languages in (a), (b), and (d). You must provide explanation for how your grammar works, by describing in English what is generated by each non-terminal. (Formal proofs of correctness are not required.) (a) {w E {0,1}* | w is a palindrome of length at least 6). (b) {O1j0k | k = 2i + 3j, i, j, k >0}. (c) Convert your grammar from (b) into Chomsky normal form. (d) {w E {0,1}* | w contains at least (w[/2 consecutive Os} (i.e., all strings of the form xoy with i > [x] + [y])