Identify the rebalanced AVL tree after the following operations: avltreeremovekey(tree, 20) avltreeremovekey(tree, 41) avltreeremovekey(tree, 67)
Options:
A) The AVL tree remains unchanged after the specified operations.
B) AVL tree rebalancing is unnecessary for removing keys.
C) The rebalanced AVL tree structure depends on the initial tree configuration.
D) AVL tree rebalancing guarantees optimal performance after key removal.
