Given the following binary search tree, with char keys and short elements a. What is the height of the tree? b. What's the key at the root of the tree? c. How many leaves are in the tree? d. What's the key of the sibling of the node with key E? e. How many steps to find the key G? f. What is the memory required to store this tree with an array? g. Draw or describe rotation(s) and result to balance the tree, preserving in order search