Given the Bubble Sort Algorithm covered in Module 07 B (cons…
Given the Bubble Sort Algorithm covered in Module 07 B (consider ascending order sorting, that is, smaller values are followed by larger values) and the list of integers called values given below, show how each of the next two passes of the algorithm changes the list values. How many swaps did you make in total in these passes? values =