We would like to come up with a recursive solution for the kth smallest value of an

unordered array without sorting the array first. Finding the kth smallest value in a sorted

array is trivial; the answer is the index k of the sorted array. We can use this information to

create a test to help us while we develop our solution.

Use the code provided which includes a completed random test and a partial

implementation for kth smallest value. Running this code will start the randomized test

which is currently failing. Complete the implementation and ensure the test passes.