$($True$/$False with justification$).$ For the following pseudocode of Insertion Sort the Basic operation of the code is for loop.

InsertionSort$($A$,$ n$)\{$

for i $=2$ to n $\{$

key $=$ A$[$i$]$

j $=$ i $-1$;

while $($j $>0)$ and $($A$[$j$]>$ key$)\{$

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

j $=$ j $1\}$

A$[$j$+1]=$ key $\}\}$