Answer only #3, I only need the pushdown automata of the informal descriptions .

The CFG of a) S-> 00S|01S|10S|11S|

b) S-> 00S1|

2. [10 points) Give context-free grammars that generate the following languages, the alphabet being = {0,1}. (a) All strings of even length, including the empty string. (b) The language { 02n1":ne No } = {8.001.000011, 000000111.... }. 3. [10 points) Give informal descriptions of pushdown automata for the languages in the previous