Context Free language sample question

Question

Give a context-free grammar for each of the following languages. Consider, Σ={0,1}.

A. The language of strings that start with 1

B. The language of strings of the form WW^R 

C. The language of strings that contain the substring 001

D. The language {0ⁿ10ⁿ where n ≥ 0}

E. The language {0ⁱ1^j where i ≤ j}

F. The language {1ⁱ01^j01^i+j}

G. The language {0³ⁿw1²ⁿ where n ≥ 0 and w is a string that contains at least two 0’s}

H. The language {0ⁱ10^j | i is a multiple of three where i, j ≥ 0}

I. The language {0ⁱ10 ^j | j = 2 + 3i where i, j ≥ 0}

J. The language {1ⁱ01^j | j is a multiple of four or i = 3 + 2j where i, j ≥ 0}