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