Please show work in detailed steps to the solution for the following problem.

Recall the insertion sort algorithm as discussed in this chapter. Assume the following list of keys: 45, 50, 18, 60, 30, 29, 89, 10, 90, 2, 25, 70 a. Exactly how many key comparisons are executed during the third itera- tion of the for loop? (2) Exactly how many key comparisons are executed during the tenth itera- tion of the for loop? (2) Exactly how many key comparisons are executed to sort this list using insertion sort algorithm? (2) b. c