Consider a BST with n distinct values and height h. Let x be a value in this BST.

(a) Assume that x is not the largest value in the BST. How fast can you find the smallest value larger than x in the BST, in the worst case? You should find the best time complexity as a function of n and/or h.

(b) Assume that the BST has at least k values larger than x. How fast can you find the k smallest values larger than x, in the worst case?

For both parts, provide an algorithm and analyze its time complexity.