Write a binary search tree class that runs the following steps. 1. Create and insert 45,43,100,34,23, and 3 into an empty BST. 2. Print the binary search tree after deleting 15 from the tree below number 3 . 3. Print the binary search tree after deleting 67 from the tree below. 4. Print the inorder, preorder, and postorder of the original binary search tree above (including 15 and 67 ). Binary search tree class should implement the following interface