Consider the algorithmic problem Range de ned as follows: Input: a, possibly NULL, node x in a binary search tree; two key values a,b with a less or egual to b; Output: the sequence of entries in the binary search tree with root x whose key values are in the range [a..b]. Give a recursive algorithm to solve the above problem.