This is an assignment for Algorithm course.

# Using correctness of insertion sort (use an array) to proof mathematical induction. Please see the below attachment to use that theory to answer your question. {precise your answer}

Chapter 2 Getting Started (a) 5 2 4 6 1 3 (b) 2 5 4 613 (c) 2 4 5 63 1 2 3 45 6 1 2 3 45 6 (d) 2 4 5 61 3 (e) 2456 (f) 12 345 6 Figure 2.2 The operation of INSERTION-SORT on the array A-(5, 2, 4, 6, 1,3). Array indices appear above the rectangles, and values stored in the array positions appear within the rectangles (a)-(e) The iterations of the for loop of lines 1-8. In each iteration, the black rectangle holds the key taken from Aj], which is compared with the values in shaded rectangles to its left in the test of line 5. Shaded arrows show array values moved one position to the right in line 6, and black arrows indicate where the key moves to in line 8. (f) The final sorted array INSERTION-SORT(A) I forj= 2 to A. length 1 - key = A[j] 3l/ Insert ALj] into the sorted sequence A[1..j -1] 4 5 whilei 0 and Ali] >key A[i +1] = key