Help! Please explain the answers as you go along! The language if needed is in Java!!

1. (25 pts) Draw the BST created by inserting the following numbers in the given order into an initially empty BST 30, 10, 100, 50, 110, 5, 15 (25 pts) Draw the binary search tree after removing the following values in sequence from the binary search tree in Figure 6.13 in Page 282 in the textbook. You must remove them using the delete method in Listing 6.6 in the textbook. 2. crowed, man, jack, that Your final BST (25 pts) Give an example of a sequence of 7 numbers, which, when sequentially added to a BST, would lead to a heavily unbalanced tree (i.e. the tree root's left subtree and right subtree have very different heights such as 0 and 6, or 1 and 5). Draw the BST Your number sequence: Resulting BST: 3. (25 pts) Take the same sequence of numbers in Q3 and build a Min-HEAP from that sequence. You must build the heap using the algorithm in Page 298. 4. Resulting Min-HEAP