PLEASE do PART ii) FIND A PDA THAT ACCEPTS L

20. Let L be the language of all words that have the same number of a's and b's and that, as we read them from left to right, never have more b's than a's. For example, abaaabbabb Is good but abaabbba is no good because at a certain point we had four b's but only three a's In Chapter 10, Problem 19, we proved that this language is nonregular when we called it PARENTHESES. All the words in L with six letters are aaabbbaababb aabbab abaabb ababab i) Write out all the words in L with eight letters (there are 14). (ii) Find a PDA that accepts L (iii) Prove that L is not regular. (iv) Find a CFG that defines L 20. Let L be the language of all words that have the same number of a's and b's and that, as we read them from left to right, never have more b's than a's. For example, abaaabbabb Is good but abaabbba is no good because at a certain point we had four b's but only three a's In Chapter 10, Problem 19, we proved that this language is nonregular when we called it PARENTHESES. All the words in L with six letters are aaabbbaababb aabbab abaabb ababab i) Write out all the words in L with eight letters (there are 14). (ii) Find a PDA that accepts L (iii) Prove that L is not regular. (iv) Find a CFG that defines L