Design a pushdown automaton that recognizes the language

L $=\{$a$^$n b$^($n$+$m$)$ a$^$m $|$ n$,$ m $>=0\}$

Describe the design idea and show the acceptance of the string w $=$ aabbba through configurations.