Coding to be done in Java Eclipse.

Write a program that inserts the numbers into an initially empty BST such that the tree produced is equivalent to binary search tree. Insert 16 as a root node then add 1 into 16 to generate 2nd number for insertion, add 2 to the 2nd number to generate 3rd number continue adding according to the level of the tree till 5th level. Then subtract 1 from root node to generate 7th node Continue subtracting till level of 5th level. 1) The Insert function will only take the root node and construct the entire tree 2) Implement a remove function which can remove the 3rd layer numbers from right and left both sub trees. 3) Implement a function to find the number which is nearby to your given age