Consider a binary search tree (BST). Assume that the keys are integers and no values (objects) other than the keys are stored in each node. By following the explanations and examples given in class, design an algorithm for operation remove(k)