show the keys with which each of the following targets will be compared in search of the preceding binary search tree notes insert each of the following keys into the preceding binary search tree show the comparisons of keys that will be made in each case do each part independentlyinserting the key into the original tree delete each of the following keys from the preceding binary search treeusing the algorithm developed in this section do each part independentlydeleting the key from the original tree draw the binary search trees that function insert will construct for the list of names presented in each of the following orders and inserted into previously empty binary search tree jan guy jon ann jim eva amy tim ron kim tom roy kay dot amy tom tim ann roy dot eva ron kim kay guy jon jan jim jan jon tim ron guy ann jim tom amy eva roy kim dot kay jon roy tom eva tim kim ann ron jan amy dot guy jim kay consider building two binary search trees containing the integer keys to inclusivereceived in the orders all the odd integers in order ( )then then the remaining even integers in order ( then all the odd integers in order ( )then the remaining even integers in order ( which of these trees will be quicker to buildexplain why [try to answer this question without actually drawing the trees prepare package containing the declarations for binary search tree and the functions developed in this section the package should be suitable for inclusion in any application program in each of the followinginsert the keysin the order shownto build them into an avl tree azbycx abcdef mteazgp azbycxdwevf abcdefghijkl avltreisok lovely professional university