With a suitable parallel processor, a search for the largest of $1,000,000$ numbers requires $(2*$lgN$),$ or $\_\_\_\_$ steps.

Group of answer choices

$1$

$500$

$40$

$1,000,000$