In this given question I find all answers false because while implementing binary seach or tracing it for an example we need to follow same approach Right? if we are taking ceil for evaluation then it should be considered throughout and if we are taking floor accordingly it should be traced.Therefore applying both operating individually I find none of the options matching. Correct Me If I am wrong here.
option 1 is correct, see below,
bolded keys show target array for binary search and bolded key show target key.
mid = floor(10+1/2) = 5
11(5)
mid = floor(1+4/2) = 2
mid = floor(3+4/2) = 3
mid = floor(4+4/2) = 4
Gatecse