a) Describe the insertion sort algorithm.________________b)Use the insertion sort algorithm to sort the list 2, 5. 1, 4, 3.________________c)Give a big-O estimate for the number of comparisons used by the insertion sort.

Solution Step 1:In part (a) we have to describe the insertion sort algorithm in part (b) using insertion sort algorithm we need to sort the list 2,5,1,4,3 and in part (c) we have to give a big-O estimate for the number of comparisons used by the insertion sort.