Outline, but do not implement, a recursive solution for finding the kth smallest element in an array. Hint: Look at the elements that are less than the initial element. Suppose there are m of them. How should you proceed if k m? If k > m?

Java