Would you please explain this algorithm visually. This is what i have however i get mixed up.

INSERTION-SORT(A) 1 for j = 2 to A.length key A[j] // Insert A[j]into the sorted sequence A[1.. j i = j - 1 3 1]. 4 ! while i > 0 and A[i] > key A[i + 1] = A[i] i = i 1 A[i + 1] = key 5 %3D 2. w Clement at ndex Mj] In sor Hon sort CArr (]) for Clint j=2; j> Ardrel); jut) s2/10) [!34 = hod sequerce ky= // In gert ACi] nto sorted 13 sarted unsorted s2/10 [] j= j~l l/2-1 = 1/;= | While C;so) $ ACi]> bay * element of arruy atndey i A Citi] =ACi] 3+1= ACy) i= 2-1=1