C++: write a code for insertion sort and merge sort showing how long does it take to run data set size of 2,000-40,000

by modify this example code and show insertion vs merge:

/* The purpose of this program is to demonstrate selection sort and other programming features. Selection sort begins by traversing the unsorted part of the array one element at a time and finding the smallest element. The smallest element is then placed in the first position of the unsorted part of the array. In the first traversal, the whole array must be passed through because the whole array is unsorted. When the array has been traversed, the small element is swapped positions with the smallest position in the array. Now the array has a sorted part, consisting of the first item, and the unsorted part which is the rest of the array. The second traversal of the unsorted array begins with the second item of the array, when the traversal is complete the second smallest item of the array has been found and is swapped with the second item in the array. Similarly, the third, fourth, and subsequently small items of the array are swapped into their positions as well until the entire array is sorted. */ #include  // Used for input and output. #include  // Used for getch(). #include  // Used for random number generation. #include  // Used to seed the random number generator. using namespace std; // Press any key to continue. void pressAnyKey() { cout   Time Performance of Sorting Algorithms 600 500 400 300 200 100 Bubble Sort Insertion Sort Quick Sort 0 0 0 5000 0.145 0.045 0 10000 0.6 0.18 0 50000 14.05 4.25 0.01 100000 56.9 17.62 0.02 200000 229.44 69.12 0.05 300000 513.34 154.22 0.065