C-4.8 Show that at most one node in an AVL tree becomes unbalanced after operation removeAboveExternal is performed within the execution of a remove operation.

Please provide answer and pseudocode.

ll ineal Hode with two external-node children u.key k v.element_e height 1 rebalanceAVL(v, T) Algorithm removeAVL(k, T): Input: A key, k, and an AVL tree, 2T Output: An update of T to now have an item (k, e) removed v lterativeTreeSearch(k, T) if v is an external node then return "There is no item with key k in T" if v has no external-node child then Let u be the node in T with key nearest to k Move u's key-value pair to v Let w be v's smallest-height child Remove w and v from T, replacing v with w's sibling, 2 rebalanceAVL(2, T) Algorithm rebalanceAVL(v, T): Iunut: A node, v, where an imbalance may have occurred in an AVL tree