Step 1: Write a C++ module to create 500( code so that the size of the arrays is easy to change) element integer arrays

Array 1: Create a sorted array (integers stored in ascending order)

Array 2: Create an unsorted array (integers stored in descending order)

Array 3 : Create an unsorted array (integers stored in random order with no duplication)

Step 2: Implement each of the following sort algorithms

Bubble sort

Bubble sort (with flag)

Insertions sort

Selection sort

Merge sort

Quick sort

Step 3: Run each algorithm using each of the 3 array options (remember data must be returned to its initial state after each sort.

Count the number of exchanges made by each algorithm for each option and print the results in tabular form.