In an ordered array of size N, binary search finds an answer in 10 steps maximum. What is the max number of steps will the binary search need for an array of size 2 * N?

In an ordered array of size N, binary search finds an answer in 10 steps maximum. What is the max number of steps will the binary search need for an array of size 2 * N?

In an ordered array of size N, binary search finds an answer in 10 steps maximum. What is the max number of steps will the binary search need for an array of size 2 * N?



  1.     N
  2.     20
  3.     N+1
  4.     11