Please do in C++

Create (1) array of 1024 random integers values 0-99. Copy the array before each set of algorithm runs.

Time all three sorts

Time Binary Search Algorithm

Create an array of (10) random values from 0 to 99. Do not sort.

Implement the binary search code from your book.

Your program is to perform the following:

Open a single file to capture your outputs.

Run the unsorted array through each of the (3) sorting algorithms.

Output to your file: Label your sorting algorithms and output the timing for each. Include your unit of measure notes.

Calculate the maximum number of Key Comparisons (see book) that a 1024 element search can make. Output a label and value for this calculation.

For each of your 10 random numbers complete run of your Binary Search.

For each of your Binary Search runs output the following table:

The value being searched for.

Iteration, First Index, Last Index, Mid Index, List[Mid], and number of Key Comparisons

Calculate and output labeled (Maximum Actual Key Comparison) value.