Problem 1 Context-Free Gram A palindrome is a string that reads the same backward as it does forward. For example, abaaaba is a palindrome. Suppose that we need to define a language that generates palindromes. 1. Define a context-free grammar that generates the set of all palindromes over the alphabet (a b) clearly describing the recursive rules that generates palindromes. Use the notati Symbol rule. The empty set is denoted by X grammar 2. Show the set of terminal symbols and the set of non-terminal symbols in your 3. Show that the palindrome abaaaba can be recognized by your grammar. To show this, sh all steps of parsing the expression abaaaba using the rules you defined above