A sorting algorithm where a list is divided into $2$ parts, sorted and unsorted and values

are taken from the unsorted side from left to right and put into their sorted position on the

sorted side is called the

a$.$ Insertion sort

b$.$ Bubble sort

c$.$ Selection sort

d$.$ None of the above