Recall that the insertion sort algorithm is given as follows:
def InsertionSort (A):
for i in range (1, len (A)): ji-1 k = A[i] while (j >= 0) and (A[j]> k): A[j+1] = A[j] j = 1 A[j + 1] = k
return A
Write down each complete list obtained when the following list is received is input:
[7, 6, 1, 4, 3, 2, 5]
Do not write the original list received as input, do not write the same list more than once, and do not include any spaces in your answer.