in java

1.(20) Assume that a binary search tree BST of integer is created. First, we call insert 10 times to insert integers 11, 22, 15, 44, 6, 9, 3, 33, 17, 5 into the BST in that order; then we call delete 2 times to delete the nodes with 13, 22 from the BST, respectively; finally we call insert again to insert 18 into the BST. Draw the final tree after above operations are finished. (Note, you must use an app to draw the tree. Hand drawing is not accepted)