[12 marks] This question develops your ability to design CFGs. For each of the following languages, give a CFG. Assume the alphabet is {0, 1). Justify your answers briefly. (a) is a palindrome Recall a palindrome is a string that looks the same forwards and backwards Examples of palindromes are" (b) { the length of x is odd) (c) 0 (d) z r does not contain any substrings of I's of odd length. For example, e, 011, 111100011 are in the madam" and 'racecar" language, but 10011 is not