Question 1 a) Evaluate the following postfix expressions: + i. 70 14 4 5 15 3/../6 + = ii. 3 5 6 13 - 18 2 / + = (4 marks) Convert the following infix expression to equivalent postfix expression for the: (a - b)* (c+d) (2 marks) b) In queue data structure, an identical value of queueFront and queueRear might trigger a problem for an empty and a full queue. State what is the problem occurred and propose the solution for it. (4 marks) Question 5 a) You are given the following data set: 30, 25, 40, 15, 33, 28, 17, 12, 55, 20 i. Design a binary search tree (BST) based on the list data sequential entry. (5 marks) Based on your answer in (1), design an AVL trees using proper rotation