Design a context free grammar for the following languages

Please help

3. (30 points) Design a CFG for each of the following languages: a) L-tap? I (ij), where i, j, k > 0} b) L2= {a'V#1 (it k), where i, j, k20} c) La = {a'bjck I (i or i k), where i, j, k 0} d) The set of all strings over alphabet (a,b) such that the mumber of a's is at least as many as the number of b's. e) The set of all strings over alphabet {a, b} that are of odd length. f) The set of all strings of a's and b's that are not of the form ww