Must be in C++

LAB 2: CS 425 e: 02/12/2021 Implementation of Quick Sort in C++ Write a program and use random data to sort them using Quick Sort. The pseudocode for Quick Sort is given as below: PARTITION(A, P, r) pivot + A[r] itp-1 jer while TRUE while(true) repeat { ici + 1 do { until A[i] > pivot repeat } while (A[i] > N; A = new int [N+1]; // Now get the inputs for A int i; cout > A[i]; //Now call Quicksort QuickSort(A, 1, N); // Display sorted array End main 4. Define two functions by changing pseudocode to C++ functions In order to use the swap function you might need header file cstdlib Also swap is used as swap(A[i], A[j]); Just to show you how the QuiickSort function should be written: void QuickSort(int A[], int p, int r) { int q; if(p