2.) Write the recursive function (in C ): void quickSort(int arr[], int left, int right); that implements the quicksort algorithm on an array of integers. Take the value of the middle element as the pivot value. Include the partition functionality in this same function. Use recursion to quicksort the array. Do not write a complete program. Only the function is requested