Design a PDA A to accept the context free language CFL L = { w |w has an equal
number of 0’s and 1’s}, such that L=L(A). The PDA that you aim todesign should
make its acceptance by Final State.
b-)give an equivalent
CFG G such that L(A)=L(G).