Give context-free grammars that generate the following languages, all over the alphabet = {0, 1} (a) L1 = {w |w starts and ends with the same symbol} (b) L2 = {w |w the length of w is odd} (c) L3 = {w |w = wR, that is, w is a palindrome}