C++

implement the quickSortDivide() function for an array of integers. Your function must have the following signature. int quickSortDivide(int *theArray, int size); Write the recursive quicksort. You must use the following signature. quickSort(int *theArray, int size); This function will use the quickSortDivide you have already written and should be very short. Note: You return the final position of the pivot in the array. The array variable provides the address of the first element of the array to be divided, so first index position will always be 0