Suppose we are doing selection and merge sorts on the list below, and that we are operating on a computer where essentially every operation is cost$-$free $($takes $0$ time to execute$)$ except for the act of assigning a value into a slot of the array passed in $($such as setting a$1[0]=42$;$),$ which requires $100$ units of time. $($Assigning a value to a normal int variable, or into any other array or collection, requires no time in this hypothetical model.$)$ How long does each algorithm take to run for this particular data under these particular conditions? Which sorting algorithm requires less time to run? Assume that selection does not perform a swap if not necessary, that is$,$ if the two indexes of interest are the same.