1. Draw a Binary Search Tree (BST) whose elements are inserted in the following order: [10 Marks] 50 72 96 94 102 26 12 11 92 10 2. Use the the following tree to answer the questions: 2.1 Calculate the maximum depth/height of the BST. [1 Marks] 2.2 What nodes are on level 4? [2 marks] 2.3 Trace the path that that could be followed in searching for a node containing 30. [2 Marks] 2.4 Write down the order in which the nodes are prosseced by a. a postorder traversal of the tree [3 Marks] b. an inorder traversal of the tree [3 Marks] c. preorder traversal of the tree [3 marks] 2.5 Show how the tree will look like after the deletion of 29, 59,47. [5 Marks] 2.6 Show how the (original) tree will look like after the insertion of node containing 63,77,76,48,9,10 (in that order). [6 marks]