A large sorted array containing about $30,000$ elements is to be searched for a value

key using an iterative binary search algorithm. Assuming that key is in the array,

which of the following is closest to the smallest number of iterations that will

guarantee that key is found? Note: $1032$

$10$

$.$

$($A$)15$

$($B$)30$

$($C$)100$

$($D$)300$

$($E$)3000$