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

Consider the following list: 8, 14, 40, 52, 60, 65, 2, 90, 23 The first six keys are in order. (2) a. To move 2 to its proper position using the insertion sort algorithm as described in this chapter, exactly how many key comparisons are After moving 2 to its proper position, exactly how many comparisons are executed? b. to its proper position