A. It was remarked in your textbook that the performance of the bubble sort can be improved if we stop sorting process as soon as we find that in an iteration no swapping of elements takes place. Write a function than implements bubble sort algorithm using this fact.
b. Using the algorithm in that you designed in part (a), find the number of iterations that are needed to sort the list: 65, 14, 52, 43, 75, 25, 80, 90, and 95.