Please generate the arrays containing random integers with the sizes shown in the table 1. Also, run the algorithms on each array and measure the approximate run times. The program should generate a table similar to the one shown in the table 1. (The question marks in the table represent run times in microseconds.) Then, generate arrays of the same sizes but these array will contain random doubles. Once the program generates the tables by sorting integers arrays that contain random integers, then templatize the functions where necessary so that you are able to sort arrays of doubles and integers. Write this application incrementally.

Table 1 - Using Arrays With Random Integers (Time to sort an array of random integers):

n	selectionSort	bubbleSort	quickSort
100	?	?	?
500	?	?	?
1000	?	?	?
5000	?	?	?
10000	?	?	?
50000	?	?	?
100000	?	?

Table 2 - Using arrays with random floating-point values (time to sort an array of random fixed-point values)

n	selectionSort	bubbleSort	quickSort
100	?	?	?
500	?	?	?
1000	?	?	?
5000	?	?	?
10000	?	?	?
50000	?	?	?
100000	?	?	?

N/A

N/A