When value $27$ is removed from the binary search tree shown below, which procedure will result in a reduced binary search tree with greatest balance. Use this definition of "balance": Compute the absolute difference Ddiff between the depths of both subtrees of the root node. Smaller Ddiff means greater balance. Example: The initial BST has Ddiff $=|2-4|=2(2$ nodes along longest path in left subtree, $4$ nodes along longest path in right subtree$).$