Question: A palindrome is a string that reads the same backward as it does forward, that is, a string w, where w = wR, where wR is the reversal of the string w. Find a context free grammar that generates the set of all palindromes over the alphabet {0, 1}.