1)Let A = [43, 32, 76, 25, 12, 98, 54, 67] be an array. a. Rearrange the elements of A so that when you apply insertion sort, it will make the largest number of comparisions. b. Rearrange the elements of A so that when you apply insertion sort, it will make the smallest number of comparisions.

2)Apply insertion sort to sort the list T, H, I, N, K, I, N, G in alphabetical order (show the content of the list after each iteration of the outer loop for the insertion sort).