1. (3 pts) What is a binary search tree (BST)? Describe the properties of a BST in your answer. 2. (6 pts - 1 ptumber) Given the following sequence of numbers: 100, 75, 70, -50, 7, -25. If the numbers are inserted into a BST in the sequence provided, then what would the tree look like? Draw a diagram for the BST Be sure to show both branches of a given node. 3. (6 pts) Fill-in-the-blank - Using the BST constructed in question (2), answer the following questions: 25? Pe) ii. (1 pt) How many children does the node containing the number 100 i. (1 pt) How many node comparisons are required to find the number 252_ have? iii. (1 pt) What is the height of the tree? iv. (1 pt) What is the depth of the node with value 7? v. (1 pt) How many leaf nodes exist in the tree? vi. (1 pt) At what level is the root node