Which of the following best summarizes the selection sort algorithm?

Repeatedly swap values with the next value in the list.

Repeatedly select a random, unsorted value and put it in its sorted position.

Repeatedly select the smallest remaining value and put it in its sorted position.

Repeatedly swap values with the value in the first position.

$2$

Selection sort requires minimal extra memory as it can be performed in place in an array.

True

False

$3$

In Python, swapping two values in a list can be done with one line of code.

True

False

$4$

The selection$\_$sort function uses a single loop to perform sorting by comparing each element exactly once.

True

False