$(5$ points$)$: Draw up a Push$-$down automaton which accepts the language

L$=\{$a$^($n$)$ba$^(2$n$)$:n$>=0\}.$

I need a diagram to help understand what this is supposed to look like. I understand what I need to do but don't understand how to write the diagram in terms of describing pushing, and creating the stacks so PLEASE help me by just drawing what the PDA is meant to LOOK like