I'm pretty sure the answer is D. I may be wrong but D is most likely the answer because A and B are correct.
Answer:
Okay... Well
I will. help you out dear
Answer:
≅500,000 comparisons.
Explanation:
The sequential search algorithm is, as its name express, a comparison method to search for a specific value in a list, sorted or not.
It starts with the first element in the list, compares the element with the searched value, if it is a match it stops, otherwise it moves to the next element and repeats.
In general, if the list size is X, the average number of comparisons is:

Solving for X=1,000,000, the result is ≅500,000 comparisons.
Answer: typing keys
Explanation: it’s obvious...