Draw a PDA to recognise the language $\{($n$)2$n $|$ n $>=1\}($sequences of

n $>=1$ many opening brackets followed by $2$n many closing brackets$).$

Your answer must make clear whether your PDA uses acceptance by

empty stack or acceptance by final state. $($