1. Construct a Pushdown automata (PDA) accepting the language L = {0'1'|i20U01 j20). 2. For = {0,1), design DPDAs to accept the following languages: (a) 0* (b) {0'10'1' 1,020) (c) {0 1'|i21) (d) {0"1"| m n 3. Define the concepts of string and language acceptance for PDAs. 4. For - {0,1), design PDA to accept the following languages: (a) xx|x E{0,1}} (b) XXE {0,13' and x = x (c) {0"1" nsm s 2n} (d) {0"1" 3n sms 7n 5. Construct a PDA accepting {a"b3|n21} by empty store. 6. Obtain the PDA accepting {a"6"c" | m, n 21} by empty store, 7. Obtain the PDA accepting {a"b"c" m, n 2 1} by final state. 8. Given L = {a"b" m n (1) (b) xe{a, b :ng (x) = x(x); 13. Design a PDA recognizing the set L of all non-palindromes over {a,b). 14. Construct a PDA equivalent to the CFG. SBB, BOS, BS, B 15. Construct a CFG accepting L = {a"b"In<>