Build a Java program that will support the creation of aBinary Search Tree, hereinafterreferred to as aBST. This program will support reading a command file that supportsinsertion, deletion, searching, printing, and subtree children and depth counts. All outputwill be to eitherSTDOUTorSTDERR.2 Requirements1. Read the input file formatted as follows. The input file will contain at least onecommand per line, either insert, delete, search, print, or quit. These are defined indetail below. For example, one of the input files, namedin5.txtcontains the following:i 9i 24i 3i 4i 11pq2. The specific commands areifor insert,dfor delete,sfor search,pfor print, andqforquit.(a) InsertThe insert command uses the single characterias the command token. Thecommand token will be followed by a single space then an integer.(This command’s success can be verified by using theprintcommand.)•Forinsertionorrealigningoperations, less than goes left, equal to orgreater than goes right.(b) DeleteThe delete command uses the single characterdas the command token. Thecommand token will be followed by a single space, then an integer.In the event that theintegercannot be found, the program will issue an errormessage toSTDOUTand recover gracefully to continue to accept commandsfrom the input file.command-> d 100: integer 100 NOT found - NOT deleted(This command’s success can be verified by using theprintcommand.)(c) SearchThe search command uses the single charactersas the command token. Thecommand token will be followed by a single space, then an integer.In the event that theintegercannot be located, the program will issue an errormessage toSTDOUTand recover gracefully to continue to accept commandsfrom the input file.command-> s 101: integer 101 NOT found(d) PrintThe print command uses the single characterpas the command token. Thiscommand will invoke theprintfunction which will output the data in the treeinorder.This command is critical for verification of all the commands specified above.(e) QuitThe quit command uses the single characterqas the command token. In theevent the quit command is invoked, the program exits. There is no requirementfor data persistence.2.1 FunctionsWhile there are no specific design requirements (with one exception), it might be a mean-ingful suggestion to consider breaking this problem into several small classes. For example,aBSTclass and aNodeclass would seem to be the minimal set of classes.2.1.1 Required Function(s)•complexityIndicatorPrints toSTDERRthe following:–NID–A difficulty rating of how difficult this assignment was on a scale of 1.0 (easy-peasy) through 5.0 (knuckle busting degree of difficulty).–Duration, in hours, of the time you spent on this assignment.–Delimit each field with asemicolonas shown below.–Sample output:ff210377@eustis:~/COP3503$ ff210377;3.5;18.5•countChildrenwhich will countallnodes on the left branch of the BST, and thenthe right branch.•getDepthwhich will provide the depth of the right and left branches of the BST.