Modify your program so that it prints the array at each step of the algorithm.

#include using namespace std; // Function prototypes void sortArray(int [], int); void showArray(const int [], int); int main() { // Array of unsorted values int values[6] = {10, 2, 6, 4, 9, 1}; // Display the values. cout << "The unsorted values are: "; showArray(values, 6); // Sort the values. sortArray(values, 6); // Display them again. cout << "The sorted values are: "; showArray(values, 6); return 0; } //*********************************************************** // Definition of function sortArray * // This function performs an ascending order bubble sort on * // array. size is the number of elements in the array. * //*********************************************************** void sortArray(int array[], int size) { bool swap; int temp; do { swap = false; for (int count = 0; count < (size - 1); count++) { if (array[count] < array[count + 1]) { temp = array[count]; array[count] = array[count + 1]; array[count + 1] = temp; swap = true; } } } while (swap); } //************************************************************* // Definition of function showArray. * // This function displays the contents of array. size is the * // number of elements. * //************************************************************* void showArray(const int array[], int size) { for (int count = 0; count < size; count++) cout << array[count] << " "; cout << endl; }