Consider the following grammar where uppercase letters indicate non-terminals and lowercase letters indicate terminals. Show the derivation process and draw a parse tree for string aab
S→AB
A→A a ∣a
B→Bb∣b​