Give a psudocode

1. Give pseudocode for an algorithm that accepts a BST node and an integer k and retuns ethsmaes element in the BST rooted at that node. For example, the tree rooted at node A below contains the values 5, 10, 15, 20, and 25. The 4th smallest element in this tree is 20, so the problem instance with node A and k = 4 should return 20. 20 10 25 15 The behavior of the algorithm is undefined if k is too small or too large; e.g., calling the algorithm with k =-1 can return anything. In adlition to the usual value, left, right, and parent fields, the BST nodes have a count feld that stores the number of nodes in the tree rooted at this node. The count values appear in te diagram as small numbers below each node. Hint: I recommend a recursive algorithm