How does selection sort compare to bubble sort and insertion sort in terms of swaps? Note that an element swapping with itself still counts as a swap. Also assume that we're running these algorithms on the same input. Check all true statements.

Selection sort will always do no worse than bubble sort.

Selection sort will always do no worse than insertion sort.

Selection sort will always do no better than bubble sort.

Selection sort will always do no better than insertion sort.

Selection sort will do better than bubble sort in most cases.

Selection sort will do better than insertion sort in most cases.

Selection sort will do worse than bubble sort in most cases.

Selection sort will do worse than insertion sort in most cases.

Selection sort and bubble sort are generally incomparable in swap counts.

Selection sort and insertion sort are generally incomparable in swap counts.