sec projects (ashow the result of building bintree from the following points (inserted in the order givenassume the tree is representing space of by units ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( (bshow the result of deleting point from the tree you built in part ( (cshow the result of deleting point from the resulting tree in part ( compare the trees constructed for exercises and in terms of the number of internal nodesfull leaf nodesempty leaf nodesand total depths of the two trees show the result of building point quadtree from the following points (inserted in the order givenassume the tree is representing space of by units ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( projects use the trie data structure to devise program to sort variable-length strings the program' running time should be proportional to the total number of letters in all of the strings note that some strings might be very long while most are short define the set of suffix strings for string to be ss without its first characters without its first two charactersand so on for examplethe complete set of suffix strings for "hellowould be {helloellollolooa suffix tree is pat trie that contains all of the suffix strings for given stringand associates each suffix with the complete string the advantage of suffix tree is that it allows search for strings using "wildcards for examplethe search key "th*means to find all strings with "thas the first two characters this can easily be done with regular trie searching for "*this not efficient in regular triebut it is efficient in suffix tree implement the suffix tree for dictionary of words or phraseswith support for wildcard search revise the bst class of section to use the avl tree rotations your new implementation should not modify the original bst class adt compare your avl tree against an implementation of the standard bst over wide variety of input data under what conditions does the splay tree actually save time