a) Describe the bubble sort algorithm.________________b) Use the bubble sort algorithm to sort the list 5, 2, 4, 1, 3.________________c) Give a big-O estimate for the number of comparisons used by the bubble sort.

Solution Step 1:In part (a) we have to describe the bubble sort algorithm in part (b) using bubble sort algorithm we need to sort the list 5,2,4,1,3 and in part (c) we have to give a big-O estimate for the number of comparisons used by the bubble sort.