Question 1) (5 pts.) Here's a scenario: You are asked to choose a sorting algorithm for a set of data, but you are unsure what the data type will be. You've been told that you will be able to use comparison operators, and that the data is, in general, mostly sorted. Memory, in this scenario, is not an issue. Between insertion sort and merge sort, which would you use and why