in insertion sort suppose we cut the array ;ole a deck of cards to get the input array $($ i$+1,$i$+2,...,$n$,1,2,...,$i$)$ for some i element of $\{1,...,$n$\}.$ n terms of i and n $,$ exactly how many swaps does insertion sort perform on this input and what is the asymptotic $($big$-$theta$)$ running time?