2. (a) Suppose elements (1,3,2, 4,7,6,5) are inscrted in this order into an empty bi- nary search tree. Draw the resulting tree Using the tree you drew in part (a), write down its elements in the order they are visited when the tree is traversed in in pre-order Repcat part (b) for in-order traversal for the same trec Repeat part (b) for post-order traversal for the same tree Write a function whose input is (the root of) a binary search tree T and the output is the sum of those contents of the nodes of T that are even. For instance, if the contents of the nodes of the tree are (25, 20, 35, 30,45, 40, 55) then the sum must bc 20 +30+40 (5 marks) (b) (c) (d) (e) (3 marks) (3 marks) (3 marks) 90 (6 marks)