In the context of the Insertion Sort algorithm, what does the main step involve?

Group of answer choices

Inserting the next element to its correct position in the sorted part.

Selecting the smallest element and adding it to the end of the list.

Repeatedly swapping adjacent elements until the list is sorted.

Dividing the list into two equal$-$size parts and sorting them separately.