1. To represent arithmetic expressions as a binary tree, the postfix notation must be in intix notation. Build a binary tree based on the following arithmetic expression written in postfix notation. P3 (8 marks) 27 5 6 39 81 16 28 65 99 24 35 40 76 figure 48) 2. a. Explain the result of deleting the node with key 81 in tree based on Figure 2(a). P2 (2 marks) b. Display tree based on answer in 2(a). P2 (2 marks) c. Trace the nodes in preorder, inorder and postorder traversal based on Figure 2(a). P3 (9 marks)