Given the following list: A={8,20,1,17,25,6,77,16,15} 1. Start by drawing the BST that results from inserting A into an empty tree. 2. Next, identify all leaf nodes in the BST. Given the following list: B={1,6,8,15,16,17,20,25,77} 3. Draw the BST that results from inserting B into an empty tree. 4. Using the BST from problem \#1 and problem \#2, draw conclusions as to the efficiency of searching for a node in a BST. I'm not looking for the textbook answer. I'm looking for what conclusions YOU can draw