Binary Search Tree Write a program that creates a binary search tree and then allows searches in this tree. Your program should read from a file named strings. The file will contain unique character strings, one per line. Build a binary search tree by adding these strings to the tree in the order they appear in the file. After traversing the tree, ask the user for a string to search for. As you are searching for this string, show your search path through the tree by printing an ‘L’ every time you follow a left branch and an ‘R’ when you follow a right branch. Print all of the ‘L’s and ‘R’s of the search on a single line with no spaces between them. After searching, print a short message stating whether or not the string was found. Allow the user to search for strings until the string STOP is entered.