Draw the Binary Search Tree (BST) that results when you insert the keys EASY QUESTION, in that order (associating the value i with the ith key, as per the convention in the text) into an initially empty tree. Show all steps! How many compares are needed to build the tree? Draw the sequence of BSTs that results when you delete the keys from the tree of Question 1, one by one, in the order they were inserted