Computer Science basic. USE INSERTION SORT

Consider the following list: 13, 9, 6, 3, 15, 2, 21, 4, 16, 8,11 How many comparisons will insertion sort require? Show your work by performing insertion sort on this list and counting the comparisons. a. b. How many comparisons will selection sort require? Show your work by performing selection sort on this list and counting the comparisons If the list were almost ordered (for instance: 2, 3, 4, 8, 6,9,11,13, 16,15, 21) which algorithm would be the better choice? Give a short (2-3) sentence explanation for your answer. c