In this assignment, you have to read a text file (in. txt) that contains a set of words. the first line of the file contains 3 numbers (n, s, d). these numbers represent the sequence of input words in your file. n: represents the number of words to read to build a binary search tree. you have to write a recursive insert code to create and insert these words into the binary search tree. after inserting all the items, you should show the words in pre-order in order, and post order. so, you need to create three functions for this purpose. s: represents the number of words to search from the tree. these s-words are placed after the first n words in the input file. you need to implement a search function that will be able to search these words in your bst. additionally, the search words will also be used to look in the binary search tree and count number of words in the tree that come before the search word, alphabetically. you will need to create a recursive function with the following prototype countbefore(treenode* root, char searchkey[]), where treenode is the node structure of your tree. d: represents the number of words to delete from the bst. this list of words are placed after n+words in the input file. write a recursive delete function for your task. after deleting all the items, also show the tree in three different orders of traversals.