On a list that is already mostly sorted, which sorting algorithm is likely to perform

worse, selection sort or insertion sort?

A$.$ Insertion sort, because it will cause unneeded swaps as it sorts through the

mostly sorted list.

B$.$ Selection sort, because it will unnecessarily search for minimum elements, which

are likely to be in the correct place already in a mostly sorted list.

C$.$ The two algorithms will perform exactly the same.

D$.$ This cannot be determined from the given information.