How many comparisons does the new algorithm devised for the insertion sort use to sort the list n$,$ n $1,...,2,1?$

Multiple Choice

n$12$

n$($n$12)$

n$($n$+12)$

n$+12$