Given an unsorted array, A, of integers and an integer k, describe and implement a recursive algorithm for rearranging the elements in A so that all elements less than or equal to k come before any elements larger than k. What is the running time of your algorithm on an array of n values? Provide both the growth function and BigOh complexity. Create a driver class to test your implementation.

Using Java please.