Documenti ferences Mailings Review View Tell me AS E 21 AaBbccdee AalibeDdee AaBBCCDC ABCDE No Spacing Heading Heading 2 Normal Unless otherwise noted, the alphabet for all questions below is assumed to be = {0,1). This question develops your ability to design PDAs. For each part below, give the state dingram or a pushdown automata. For each automata, include a brief description of the idea behind its design (a) (x is a palindrome). Recall a palindrome is a string that looks the same forwards and back- wards. Examples of palindromes are "madam" and "racecar". (b) {* the length of r is odd). (e) {+ has equal numbers of Os and 1s). (Hint: Use the stack to store the current difference in the numbers of Os and 1s.] This question forces you to practice the generic construction for mapping a CFG to a PDA. Specifically, for the grammar G below, use the construction from Theorem 2.20 to construct an equivalent PDA P. A+ A+BB BBCIC C (A) 5 Focus