Objective: Implement code for a Binary Search Tree using the text provided or information gathered from research. add methods to the Your tasks in this assignment are to Binary Search Tree class to permit the construction of simple binary search trees. You are then required to write a driver program to create a BST and to test the functions you have added to the class. Problem statement: Write a method called "insert" for the Binary_ Search_Tree class. This method should take a single parameter, which should be the value to be added to the tree. For example, if myTree is a Binary Search Tree object, then myTree.insert(7) should create a Binary_Tree Vertex object, store 7 in that object, then add this vertex to the tree in the appropriate position. The file Names.txt consists of a list of names. Create a binary search tree containing these names, inserting them into the tree in the order they appear in the text file. Use your displayTree method to print out the resulting tree. Assignment (1) Complete the "insert" function (2) Validate the function by writing a driver program, bstTest.java, which imports your classes, tests them, and verifies that they work correctly. Think about what would be necessary to insure that your program works correctly (3) Modify your testing program to read in the data from theNames.txt file and construct a binary search tree from that data. Print out the resulting tree. Deliverables: Upload your code to blackboard. BSTcode java bstT'est.java Labeled output from a sample run of your bst Test java program. Discussion: Include the data output produced by your testing program and a discussion of what they mean. What do these results tell us about the binary search tree