hello tutros.. please solve this program using C++ and at the end provide a discussion that explains how you determined the costs on your timing............note: DO NOT use dynamic array nor variable length array......thanks

IMPLEMENT You need to fill an array with either one or 3 functions with a) random data b) ascending order data c) descending order data 1) Use the algorithm insertion sort provided as void insertionSort(int A, int nh 2) Use the algorithm quick sort provided as void quickSortlint A, int n); 3) Use the algorithm merge sort provided as void mergeSort(int A, int Wl], int n); with W as an array of working storage (W has the same length as the array A)1. Declare Win the main function. to time all 3 algorithms with arrays of data filled with a) b) and c) data So, in total there are 9 timings per n where n is the size ofthe array. Choose the values of n appropriately (suggestion, double n each time and start with n = 1000) For each of the 3 methods and each of the data sets, determine if the cost is 0(n), 0(n Iogzn) or 0(n2) and identify if this is the best case, worst case, or average case of the algorithm. To get an accurate measure for the time for small values of n, you will need to repeat the experiment In times, that is, time how long it takes to sort an array of n values to times and then divide the total time T by m. For example, for n=1 000, you may need to repeat the experiment m=10 0 times so that the total time is at least 1 time unit. For the fast algorithms, you may need to use m=1000 or larger, to get an accurate time T. 1 Do not use dynamic arrays the way it's done in the textbook