Write c++ programs for the Bubble, insertion, merge , heap and selection sort algorithms, run the programs to sort random integers in dynamic array of length starting from your university last 4 digits times, and double the number 6 times. E.g if your number ends with 1100, then the size of the array should be 1100, 2200, 4400, 8800, 17600, 35200, and 70400, record the consumed time each run, and draw a chart showing the performance of each algorithm.

compare the results with the all sorting algorithms. My number ends with 1105