Due to the sequential nature of the bubble sort algorithm, it is difficult to parallelize. For instance, the comparison of the last two elements $n-1$ and $n-2$ depends on the comparison of elements $n-2$ and $n-3$, which in turn depends on the comparison of elements $n-3$ and $n-4$, etc.

Which of the following parallelizable bubble sort variants will correctly sort an unsorted list?

Select **ALL** that apply.