Insertion Sort includes an inner loop that is dependent on the counter of the outer loop similar to the code below, what is the best closed form of the cost function T$($n$)$ only for the line count $+=1$:

for$($ int i $=0$; i $<$ n; $++$i$)\{//$

for$($ int j $=0$; j $<$ i; $++$j$)\{//$

count $+=1$; $//$

$\}$

$\}$

c $=$ constant cost for line count $+=1$;

Question $5$ options:

T$($n$)=$ c$*$n

T$($n$)=$ c$*$n$*$n$*$n

T$($n$)=$ c$*$n$*$n

T$($n$)=$ c$*$n$*($n$-1)/2$