For each part below, give the context-free grammar that generates the language specified. Convert the CFG solution from Problem 1(b) into Chomsky normal form.

a) 1 ={we{0,1}'|w contains at least one 1 and at least two Os} b) L= {a'b'ck [i+j+k is odd} (Hint: consider the cases where i, j, k are all odd, or two of them are odd, one is even, etc) c) L* = {a'b'c'd' j=1 or i+j>k+1, where i, j,k,120} d) Complement of L = {a'b'ck | j=k where i, j,k 20}