1. Write three functions to code for the following three sorting algorithms in C++. Make your own header files to decilare all the functions you need to implement each of these sorting algorithms. For example, for quicksort, you will have a header fle such as "quicksort.h", in which you will declare all the functions that you need to perform quicksort. Then you will include these header files in your main cpp program, in which you will implement and call all these functions. The input to all these sorts is the array of unsorted integers and the size of the array. For example: "void Quicksort(int array[]. int arraylength)". The output of each of these sorts is the sorted array of integers printed on the console. Test these sorts with the unsorted array - A[89,373,1,783,23,987,12,65,28,17]. All these functions should sort from smallest to largest value. Note: Quicksort's pivot should be chosen as the last element. 1. Merge Sort - void MergeSort(int array[], int copyArray[], int minindex, int maxindex) (...) 2, Quick Sort - void QuickSort(int array[, int arraySize, int startindex, int endindex) f..] 3. Heap Sort - void HeapSorttint array[], int arrayLength) {