Consider the following version of insertion sort.

Algorithm InsertSort$2(A[0..n-1])$

for ilarr$1ton-1do$

jlarri$-1$

while $j0$ and $A[j]>A[j+1]do$

$,$swap$(A[j],A[j+1])$

jlarrj$-1$

What is its time efficiency?

$1$

$n^2$

n

$nlogn$

$logn$