his 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 :

$14325$

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 in $\{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.