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 iteration of the for loop?

b. Exactly how many key comparisons are executed during the tenth iteration of the for loop?

c. Exactly how many key comparisons are executed to sort this list using insertion sort?