Sorting

Write the contents of the array below after each of the first 3 passes of the outermost loop of the given sort algorithm. Outermost loop means youve made one full pass through the data, and your sorted partition has increased by 1. For each algorithm, start fresh with the numbers array as given below. You do not need to write any code, just the output of the algorithm.

int[] numbers = {55, 21, 16, 93, 12, 29, 8};

bubbleSort(numbers);

After pass 1: _________________________________________________________

After pass 2: __________________________________________________________

After pass 3: __________________________________________________________