Let's say Insertion Sort is being used to sort a list in ascending order. How many

comparisons and shifts are made by Insertion Sort to determine the correct position of $9$ in following partially sorted list:

$-10,-8,-6,12,15,9$

Select one:

$2$ comparisons, $2$ shifts

$1$ comparison, $3$ shifts

$5$ comparisons, $2$ shifts

$3$ comparisons, $2$ shifts