No programming required please write on a page or draw neatly thanks

Binary Search Tree a) Draw the BST that results when you insert the keys MID TERM QUESTION, in that order (associating the value i with the i^th key, as per the convention discussed in class) into an initially empty tree. How many compares are needed to build the tree? b) Draw the sequence of BSTs that result when you delete the keys from the tree in question 2.a, one by one, in the order they were inserted. c) Draw the sequence of BSTs that result when you delete the keys from the tree in question 2.a, one by one, in alphabetical order. d) Draw the sequence of BSTs that result when you delete the keys from the tree in question 2.a, one by one, by successively deleting the key at the root. Binary Search Tree a) Draw the BST that results when you insert the keys MID TERM QUESTION, in that order (associating the value i with the i^th key, as per the convention discussed in class) into an initially empty tree. How many compares are needed to build the tree? b) Draw the sequence of BSTs that result when you delete the keys from the tree in question 2.a, one by one, in the order they were inserted. c) Draw the sequence of BSTs that result when you delete the keys from the tree in question 2.a, one by one, in alphabetical order. d) Draw the sequence of BSTs that result when you delete the keys from the tree in question 2.a, one by one, by successively deleting the key at the root