If searching a sock drawer for a matching sock takes at most 5 comparisons, and if each comparison takes 1 second, what is the longest possible runtime for linear search? 1 second 5 seconds 10 seconds 25 seconds