java programming01

*[Check Attached file]* Create a Java project BST in Eclipse. Copy and paste sample code of binary search tree ([login to view URL] and [login to view URL]) of Ch8 into the BST project. You need make and add BSTNode class into the project You may need adjust same names during the procedure. Add a new recursive method called balance() to balance the binary search tree. 1) While e the number of nodes in the left subtree is less than the number of nodes in the right subtree minus 1 1) Replace the value at the root node with the smallest value in the right subtree. 2) Delete the node where this value was found. 3) Add the original value of the root node to the left subtree. 2) While the number of nodes in the right subtree is less than the number of nodes in the left subtree minus 1 1) Replace the value at the root node with the largest value in the left subtree 2) Delete the node where this value was found  3) Add the original value of the root node to the right subtree. 3) Balance the left subtree. 4) Balance the right subtree. After adding the class, write an application class TestBST. In the main() of TestBST, make a BST object called tree1. Populate tree1 with numbers 1-7 as shown in Figure 1. You should get a binary search tree like the one on the left side in Figure 1. Called the balance method and tree1 should become the tree depicted as the tree at the right hand side in Figure 1.v Write your answers into a Word file, no need for using Eclipse. However, you are welcome to use Eclipse to verify your answers.