Draw a PDA for the language L over {0,1} consisting of strings with an equal number of 0's and 1's. So 010011 would be in this language. Next draw a DFA recognizing 0?1?. Use the algorithm from class to draw a PDA for the intersection of these two languages.