Rearrange the integers to produce the content of the array $A=[31,28,20,30,27,3]$ with $n$ integers after $3$ passes of

this version of Insertion Sort.

for ; $++$i$)$ passes

$e=A[i]$;$j=i$;

while $(j>0)\{$

if $(A[j-1]>e)$

$A[j]=A[j-1]$;

else

break;

j$--$ ;

$\}$

$A[j]=e$;

$\}$