In a Insertionsort of n elements, how many times in worst$-$case is the swap function called in the complete execution of the

algorithm if the array is already sorted?

$1.$n $2.$ nlogn $3\mathrm{.}04.$n$-1$