Instructions. You are provided four skeleton program named TreeNode.java and BinarySearch Tree.java. The source files are available on Canvas in a folder . Task 1 (10 pts). Implement the inorder.tree.walk() function as discussed . Task 2 (20 pts). Implement the search() function as discussed in Lecture . Task 3 (10 pts). Implement the iterative search) function as discussed in . Task 4 (10 pts). Implement the minimum) function as discussed in Lec- . Task 5 (10 pts). Implement the mazimum) function as discussed in Lec- . Task 6 (20 pts). Implement the successor) function as discussed in Lec- Task 7 (20 pts). Implement the insert) function as discussed in Lecture . Task 8 (10 pts Extra Credit). Implement the preorder.tree-walk) and Note: The parameters in some functions are different from the slides. named HW4. Please modify the skeleton code to solve the following tasks. in Lecture 7 Lecture 7 ture 7 ture ture 7 postorder.tree_walk() functions as discussed in Lecture 7 You should not change the parameter for any function. package ds; public class BinarySearchTree public TreeNode root; public BinarySearchTree (O root null; public void inorder_tree_walk (TreeNode x) public TreeNode search (TreeNode x, int k) i public TreeNode iterativesearch (int k) t public TreeNode minimum public TreeNode maximumO public TreeNode successor (TreeNode x) public void insert (int k) @param args public static void main (String[l args) 7TODO Auto-generated method stub intil array 115, 6, 18, 3, 7, 17, 20, 2, 4, 13, 9); BinarySearchTree bst; TreeNode n; bst new BinarySearchTree) for (int i 0;