f18In c++ of 6Question 2For the quicksort implementation covered in class, complete the algorithm by filling in the blanks with theproper expression or values.void partition(int a[], size_t size, size_t& pivotIndex) {// choose 1st value for pivot}int pivot = a[0];size t left = 1;}size_t right = size 1; // last item in arrayint temp;while (left <= right) {while (}}whilepivotIndextemp =a [0]}right--;}if (left < right) {temp = a[left];a[left] = a[right];a[right] = temp;=left++;a [0];a[pivotIndex];a[pivotIndex] temp;void quicksort(int a[], size_t size) {size_t pivot Index;size_t leftSize;size_t rightSize;if (size > 1) {partition (// index just right of pivotleftSize =rightSize =quicksort(quicksort(;// index of pivot// num elements left of pivot// num elements right of pivot;{;

Question 2 For the quicksort implementation covered in class, complete the algorithm by filling in the blanks with the proper expression or values. void partition(int a[], size_t size, size_t& pivotIndex) { // choose 1st value for pivot // index just right of pivot } int pivot = a[0]; size_t left = 1; } size_t right = size - 1; // last item in array int temp; while (left <= right) { while ( } } } left++; while ( right--; } if (left < right) { temp = a[left]; a[left] = a[right]; a[right] = temp; } pivotIndex = temp = a[0]; a[0] = a[pivotIndex]; a[pivotIndex] = temp; void quicksort(int a[], size_t size) { size_t pivot Index; size_t leftSize; size_t rightSize; if (size > 1) { partition ( leftSize = rightSize = quicksort( quicksort( // index of pivot // num elements left of pivot // num elements right of pivot ) ) { ); .);