****Do all problems in C++ . Any problem that uses the java.util.*, cstring, or string library will get 0 credit.

Given an unsorted array, A, of integers and an integer k, write 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?

In your comments write runtime and algorithmic approximation for each problem.