Why do I get the second half of this question wrong?

I tried redoing it here:

3 (12 points) 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 1 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 i{1,2,3,4,5}. Every time we write into one of these locations, we say that A is overwritten. Check the corresponding box on the answer sheet to answer each of the following questions. (a) What is the array content immediately after A is overwritten the 2nd time? (b) What is the array content immediately after A is overwritten the 4 th time? (c) What is the array content immediately after A is overwritten the 6 th time? (d) What is the array content immediately after A is overwritten the 8th time? 3: Read the instructions for question Q3 in the assignment document. For each of the following 4 subquestions, check the only box whose corresponding array content answers the question. ist 11414/11/15/12]key=13 2nd113/1411115/12key=11 3+2d[1314Key14=111512 th 1313141512key=11 5th \begin{tabular}{|c|c|c|c|c|} \hline 11 & 13 & 14 & 15 & 12 \\ \hline 1 & Key & =11 \end{tabular} 6 th 111/13/14/15/12 key =14 th 111/13/14/15/12/key=15 8 th \begin{tabular}{|l|l|l|l} \hline 11 & 13/14 & 15 & 12 \\ \hline 1 \end{tabular} key=12 gth 511/13/14/15/15 Key=12 10 th 211/13/14/14/15 ke y=12