We have tuples of dates of the form (rrxx(year), rr(month), rr(date)). Which sorting algorithm would you use to sort them?

Sort the following in order of asymptotic order: fa(n) = n" f2(n) = nvn f3(n) = 2" fa(n) = f4(n/2) + n

Assume you are playing a card game using a standard 52-card deck. You are dealt a hand of cards that are all the same suit, spades. You are dealt first a 5, then a 3, then 8, and finally 4. You first took the 5 into your hand. Then you put the three before the 5. Next you put the 8 behind the 5. Finally, you put the 4 between the 3 and 5. Which sorting algorithm is most similar to how you sorted your hand?  Group of answer choices   1. Quick Sort 2. Insertion Sort 3. Merge Sort 4. Selection Sort