(Solved) : C Write Several New Functions Called Selectionsort Insertionsort Mergesort Andquicksort Fu Q31742039 . . . .

C++ Write several new functions called:SelectionSort, InsertionSort,MergeSort, andQuickSort. Each functionshould take an array of integers (and any other parameters youchoose) and each function should sort the array using theappropriate sorting algorithm. Once you have the functions writtenand working correctly, run some tests to determine how long ittakes the algorithms to sort arrays of various sizes. Start witharrays of 20000 elements. Continue to double this amount until youreach 640,000 elements. Call the clock() function before and aftereach sort to determine the total amount of elapsed time requiredfor each sort (this will give you time in milliseconds).

You can save yourself some time