a) Convert the following expression to prefix and postfix notation. Show all the steps. i) P * (Q* R* (U + V)) ii) (U * V) 1 (W + X) - Y + Z iii) A / B * C - D $ E b) Show the sequence of stack configuration in the evaluation of the postfix expression below: 162/24 8/692-*+ QUESTION 2 Given the diagram of a Tree Data Structure: E X E L N T E L Answer the following questions: a) How many leaf nodes are there in the Tree? b) What is the height of the Tree? c) Identify and list all the root and parent nodes. d) Traverse the Tree and give result for Pre-order, In- order and Post-order Traversal