C++ Recursive *Quick Sort* 1. Please modify the PARTITION function below so that the array gets sorted from least to greatest. 2. pass the quickSort function an array with the following values: 5, 2, 6, 1, 3, 4 ... run the program and show a screenshot showing that it works.

double arr[] = {5, 2, 6, 1, 3, 4};

quickSort(arr, 0, 6);

for (int i = 0; i

Thank YOU!!!

PS: do not change the pivot. Our pivot must be the first element of the array.

#include using namespace std; 6 /15, 2, 6, 1, 3, 4 int partition (double arr, int start, int end) 2 4 5 int pivot - arr[start]; // pivot int i = (start-1); I for (int j - end-1; j >- start; --j) if (pivot >= arr[j]) swap(arr[i], arr[j]); swap (arr[i 1], arr[end]); return (i + 1); void quicksort(double arr, int start, int end) if ((end-start) 1) //do nothing else int pi partition(arr, start, end); quickSort(arr, start, pi - 1); quickSort(arr, pi 1, start)