Given a list of 10,000 elements, and if each comparison takes 2 µs, what is the fastest possible runtime for linear search?