Each question is based off of the pseudocode given above. Must be in C++

I uploaded the revised version. My instructor just changed the code.

LAB 2: CS 425 Date: 02/12/2021 Implementation of Quick Sort in CH Write a program and use random data to sort them using Quick Sort. 4 The pseudocode for Quick Sort is given as below: QUICKSORT(A, p. ) 1 if p > 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 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, intr) { int q; if(p