The following questions ask you to write CFGs. An example illustrates the encoding you have to use for submission. Assume your CFG has the productions Then you'd submit the following A-alATI T-bc You can use any single capital letter as a non-terminal; s is the start symbol. Any lower-case letter and any digit is a terminal. An underscode denotes the empty string E. There must be exactly one line for each non-terminal. A bar | is used to separate the choices on the right-hand side. Right-hand sides must not be empty; at least one option must be given. Each choice in a right-hand side must not be empty; it may be_ for e. Productions must not contain spacing. In summary, every production must conform to the following Python regular expression: [A-2] A-2a-z0-9_]+(IA-2a-zo-9_]+)' Please use the Precheck button to partially check the syntax of your CFG representation before submitting it to a question using the Check button. A precheck attracts no marks and no penalty; you can use it any number of times and also after incorrect submissions. If your representation fails the precheck, it will fail the full check as well. If it passes the precheck, it may or may not pass the full check. Give a CFG that generates all palindromes over 2-(a,b). A palindrome is a string which is the same when read forwards or backwards, for example, bbabbbabb. Answer: (penalty regime: 10, 20, %)