$!$

Required information

NOTE: This is a mult$-$part question. Once an answer is submitted, you will be unable to return to this part Consider the insertion sort algorithm.

How many comparlsons does the new algorithm devised for the insertion sort use to sort the list $n,n-1,$dots,$2,1?$

Multiple Cholce

$n(\frac{n-1}{2})$

$\frac{n-1}{2}$

$\frac{n+1}{2}$

$n(\frac{n+1}{2})$