Design a CFG for each of the following languages:

a) L1 = {a i b j c k | (i 6= j), where i, j, k 0}

b) L2 = {a i b j c k | (i 6= k), where i, j, k 0}

c) L3 = {a i b j c k | (i 6= j or i 6= k), where i, j, k 0}

d) The set of all strings over alphabet {a, b} such that the number of as is at least as many as the number of bs.

e) The set of all strings over alphabet {a, b} that are of odd length.

f) The set of all strings of as and bs that are not of the form wwR.