This question tests your understanding of the Insertion Sort

algorithm as stated in the textbook and the lecture slides.

Assume that we use Insertion Sort to sort the array A with $5$

elements where the initial values of the array elements $($from A$[1$

$]$ to $A[5]]$ are $A$ :

During the execution of the algorithm, we may have to write into

one of the $5$ memory locations of the array elements, i$.$e$.,$ write

into $A[i]$ for some iin$\{1,2,3,4,5\}.$ Every time we write into one of

these memory locations, we say that $A$ is overwritten. Check the

corresponding box on the answer sheet to answer each of the

following questions.

What is the array content

immediately after $A$ is overwritten the $1$st time?

What is the array content

immediately after $A$ is overwritten the $3$d time?

What is the array content

immediately after $A$ is overwritten the $5$ th time?

What is the array content

immediately after $A$ is overwritten the $7$th time?