$2.[2$pts$]$ Design a pushdown automaton that recognizes the language

L $=\{$a$^$i b$^$j $|0<=$ i $<=$ j $<=2$i$\}$

It can be non$-$deterministic and accept by empty stack or by final states. Describe the design idea and show the acceptance of the string w $=$ aabbb through configurations.