Modify the following bubble sort program to improve its performance Sorting an array's values into ascending order. #include #define SIZE 10//function main begins program execution int main(void) {//initialize a int a[SIZE] = {2, 6, 4, 8, 10, 12, 89, 68, 45, 37}; puts("Data items in original order");//output original array for (size_t i = 0; I a[i + 1]) {int hold = a[i]; a[i] = a[i + 1]; a[i + 1] = hold;}}}