Draw a state diagram of a PDA P with only 3 states, accepting the language over sigma = {0, 1}, consisting of all strings with an equal number of 0s and 1s. From the start state q_0 to state q_1, you have the transition $. Note that 3 states are sufficient, because the PDA is nondeterministic. Use the procedure of Lemma 2.27 on page 121 to define a CFG equivalent to P. Use the notation of this procedure, so that we see that you followed the procedure, and don't just provide a simple grammar generating L(P)