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 : 13 14 11 15 12. 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. 1 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 1st time?
b. What is the array content immediately after A is overwritten the 3rd time?
c. What is the array content immediately after A is overwritten the 5th time?
d. What is the array content immediately after A is overwritten the 7th time?