Write the Java source code necessary to build a solution for the problem below: You are about to start a new "Thank You Note" service and you are seeking a way to store the names of the people to whom the notes must be sent in a way that reflects the order that the gifts arrived. You searched the web and found that storing things in a binary tree is a very efficient way to do this so you begin to experiment. To explore the possibilities, you create a binary search tree and make an attempt to store the names as you think they should be stored. To test the search scheme that best reflects the order of the gifts arrival, you store the names of the sender and then do three searches to determine the best match. Remember, you have put the names in the list that is stored in the tree in the order in which they arrived. Which tree traversal algorithm best matches the list that you want to print? To solve the problem, create a binary search tree from an array of the following names: Daniel, George, Adam, Peter, Michael. Jones, Tom. Allison, James, and Brian. Perform a preorder, inorder and postorder traversal on the binary tree and print the names in the order of the traversal. Remove Peter and Brian from the tree and perform the traversal again. What do you observe when an inorder traversal is performed on the binary tree