$(10$ pts$)$ Using Insertion Sort, illustrate the operations on an array initially the sequence is $.$

INSERTION$-$SORT $(A,n)$

for $i=2$ to $n$

key$=A[i]$

$//$ Insert $A[i]$ into the sorted subarray $A[1$:$i-1].$

$j=i-1$

while $j>0$ and $A[j]>$key

$A[j+1]=A[j]$

$j=j-1$

$A[j+1]=$key

cost times

$c_{1}n$

$c_{2}n-1$

$0,n-1$

c$4n-1$

cs ${\displaystyle \underset{i=2}{\overset{n}{}}}{t}_i$

$c_6{\displaystyle \underset{i=2}{\overset{n}{}}}(t_i-1)$

$c_7{\displaystyle \underset{n-1=2}{\overset{n}{}}}(t_i-1)$

$c_8,n-1$

$\backslash$table$[[1,2,3,4,5,6]]$