AVL trees. Given the following AVL Tree: Draw the resulting BST after is removed, but before any rebalanced takes place. Label each node in the resulting tree with its balance factor. Replace a node with a both children using an appropriate value from the node's left child.