Produce a context-free grammar (CFG) for each of the following lan- guages, assuming Σ = {0,1}: (a) {w |w starts and ends with different symbols} (b) {w |the length of w is an integer multiple of 3}...

Produce a context-free grammar (CFG) for each of the following lan-
guages, assuming Σ = {0,1}:
(a) {w |w starts and ends with different symbols}
(b) {w |the length of w is an integer multiple of 3}
(c) {wwR| i.e., a word followed by that word reversed}