Write a complete C program, that Uses a one-dimension array to read 20 numbers, each of them is between 0 and 100, inclusive.
a. Uses a bubbleSort() function to sort the array in ascending order. Discuss the Big O of your sorting algorithm for the best case and worst case scenarios.
b. Write another function that improve the performance of your program by using another sorting algorithm, discuss the Big O of the new algorithm use.