search trees consider avl tree below and show the resulting tree after deleting key values and given the - tree belowshow the resulting tree after inserting key values and programming projects the binary search tree operations can also be implemented iteratively design and implement an iterative solution for each operation(asearch (bfind minimum (cinsert (ddelete design and implement the function bstmaximum()which finds and returns the maximum key value in binary search tree implement the delete operation for the avl and - trees implement the set adt using an avl search tree and evaluate the timecomplexity of each operation implement new version of the color histogram adt (from to use binary search tree for the chains instead of linked list design and implement the bstbuild(functionwhich takes sequence of keys and builds new search tree from those keys for examplethe function could be used to build the binary search tree in figure keylist [ buildbstkeylist