Which of the following sorting algorithm has the best $($lowest$)$ asymptotic runtime when the input list is already sorted?

Group of answer choices

Insertion sort

Selection sort

Mergresort

Quicksort $($choosing the first element of the array as the pivot$)$