2. Write pseudocode of an algorithm for deleting the smallest key in a binary search tree and returning a pointer to the root of the new tree. [15] You may assume the methods setLeft, setRight, getLeft and getRight are available to set/get the left/right child pointer. BSTnode deleteSmallest(BSTnode rt) Would you classify your algorithm as a variable-size-decrease algorithm? Provide reasoning, What is the time efficiency class of your algorithm in the worst case