1. Write a recursive function named small count that, given the pointer to the root of a BST and a key K, returns the number of nodes having key values less than or equal to K. Function small count should visit as few nodes in the BST as possible.
2. Write a recursive function named print Range that, given the pointer to the root to a BST, a low key value, and a high key value, prints in sorted order all records whose key values fall between the two given keys. Function print Range should visit as few nodes in the BST as possible.