Although given answer is correct one can approach in another way if one wants more visualization to this problem
Write the "postfix" expression of given parse tree keeping in mind precedences order & associativity as per question we will get { 2ab-ab+*+ }
Now write the postfix expressions of options 3 & 4 you will see same and for option 2 you will get different
(E) correct answer