Which of the following best summarizes the insertion sort algorithm?

a.Repeatedly swap values inside the sorted sublist.

b.Repeatedly insert each value in a random position.

c.Repeatedly insert values in a second list and then shift them into the first list.

d.Repeatedly insert each value into its correct position.