Consider the following list: 18, 8, 38, 25, 45, 12, 74, 60, 30
a. This list is to be sorted using the insertion sort algorithm as described in this chapter. Show the list after five iterations of the for loop.
b. Exactly how many key comparisons are executed during the first five iterations of the for loop? (2)