exercises for help with exercisesplease visit the sitewww wiley com/college/goodrich reinforcement - if we insert the entries ( )( )( , )( )and ( )in this orderinto an initially empty binary search treewhat will it look liker- insertinto an empty binary search treeentries with keys (in this orderdraw the tree after each insertion - how many different binary search trees can store the keys { } - dr amongus claims that the order in which fixed set of entries is inserted into binary search tree does not matter--the same tree results every time give small example that proves he is wrong - dr amongus claims that the order in which fixed set of entries is inserted into an avl tree does not matter--the same avl tree results every time give small example that proves he is wrong - our implementation of the treemap subtree search utilityfrom code fragment relies on recursion for large unbalanced treepython' default limit on recursive depth may be prohibitive give an alternative implementation of that method that does not rely on the use of recursion - do the trinode restructurings in figures and result in single or double rotationsr- draw the avl tree resulting from the insertion of an entry with key into the avl tree of figure - draw the avl tree resulting from the removal of the entry with key from the avl tree of figure - explain why performing rotation in an -node binary tree when using the array-based representation of section takes (ntime - give schematic figurein the style of figure showing the heights of subtrees during deletion operation in an avl tree that triggers trinode restructuring for the case in which the two children of the node denoted as start with equal heights what is the net effect of the height of the rebalanced subtree due to the deletion operationr- repeat the previous problemconsidering the case in which ' children start with different heights