(a) Design a PDA P that recognizes the language L = {x#y : |2| = ly > 0} over the alphabet = {0, 1, #1. Draw a state diagram according to the format of the textbook and the slides, i.e., start with an empty stack. Furthermore, ensure that every move either pushes or pops, but not both. (b) Obviously, you can easily create a CFG for such a trivial language like L. Here, you are asked to not just produce any CFG for L, but follow the procedure PDA-to-CFG to obtain such a grammar. Even for such a simple PDA, the grammar would be a bit lengthy. Therefore, we make one modification. You don't have to write any rules that involve variables that generate the empty language. Such rules would have no effect anyway