[25 points] Question 4 (Binary Tree) a. [5 points] Given the numbers 5, 8, 15, 17, 4, 2, 6, 7, 16, 3 draw the binary search tree. b. [5 points] For the tree above in (a) write the sequence of nodes visited by the preorder traversal. C. [5 points) Redraw tree after deleting 5. d. [10 points) Write the two recursive methods findLargest and removeLargest for the BinarySearchTree class. The method findLargest finds the node containing the largest entry in a given BST and returns node containing the largest entry in the tree. While the method removeLargest removes the node containing the largest entry in a given tree and returns the root node of the revised tree