i need questions from photo answered these are previous steps: Show the BST after inserting 45, 43, 100, 34, 23, and 3 into an empty BST.

2. Show the BST after deleting 15 from the following BST.

3. Show the BST after deleting 60 from the following BST.

4. Show the inorder, preorder, and postorder of the following BST

Write a BST class that runs the previous four steps of part 1. BST class should implement the following interface. interface java.lang.Collection \begin{tabular}{|l|} \hline \multicolumn{2}{|c|}{ "interface } \\ Tree \end{tabular} Returns true if the specified element is in the tree. Returns true if the element is added successfully. Returns true if the element is removed from the tree successfully. Prints the nodes in in order traversal. Prints the nodes in preorder traversal. Prints the nodes in postorder traversal. Returas the number of elements in the tree. Returns true if the tree is empty. Removes all elements from the tree. Note: properly document all your programs. Your program should start with the following comment lines