Show the resulting BST after inserting the symbols in the order they appear as keys. (b) [9 pts] What will be the resulting tree if you delete the root? Show the tree and explain the steps taken in deleting the root according to the delete procedure we discussed in class. (c) [9 pts] Can you reorder the original sequence of letters to obtain a tree of a smaller height? If, yes, show the permutation of the sequence and the new tree. If no, argue why a smaller height is not obtainable.