Given a list of $1000,000$ elements, and if each comparison takes $3$s$,$ what is the longest possible runtime for linear search?

Question $5$ options:

$1000,000$s

log $(1000,000)$s

$(1000,000)^2$s

$3000,000$s