$6.$II $($Bubble Sort$)$ The bubble sort presented in Fig. $6\mathrm{.}15$ is inefficient for large arrays. Make the

following simple modifications to improve its performance.

a$)$ After the first pass, the largest number is guaranteed to be in the highest$-$numbered el$-$

ement of the array; after the second pass, the two highest numbers are $"$in place," and

so on$.$ Instead of making nine comparisons on every pass, modify the bubble sort to

make eight comparisons on the second pass, seven on the third pass and so on$.$

b$)$ The data in the array may already be in the proper or near$-$proper order, so why make

nine passes if fewer will suffice? Modify the sort to check at the end of each pass whether

any swaps have been made. If none has been made, then the data must already be in the

proper order, so the program should terminate. If swaps have been made, then at least

one more pass is needed.

Solve with c language.