Given a CFG G $=($V$,\backslash$Sigma $,$ R$,$ S$)$ with set of variables V $=\{$S$,$ Y$\},$ where S is the start variable; set of terminals $\backslash$Sigma $=\{$a$,$ b$\}.$ ; and rules:

S $->$ aSb $|$ bY $|$ Ya

Y $->$ bY $|$ aY $|$

Convert the CFG to PDA.

Please draw the PDA for me to visualize it better.