a) Given \( A=[5,3,4,1,5,2] \), carry out 4 iterations of the for loop in the insertion sort algorithm. Show your work. Clearly show what values are in the array after the 4 iterations. [4]
b) For each value of \( i(0,1,2, \ldots, N-1) \) give the worst-case number of times that the condition "key < \( A[j-1] \) " is executed. [4]
c) What is the best- and worst-case number of times is the assignment " \( j=j-1 \) " executed? [4]
d) Give an array with 5 positive integers that will make the line " \( \mathrm{j}=\mathrm{j}-1 \) " be executed the greatest number of times. [2]