If we apply binary search to find first occurrence of 1 in the list, it will give smallest index i.
In this array, sequence of 0's is followed by sequence of 1's so it is sorted. So we can apply binary search directly.
Number of probes performed = ceil(log31 base2) = 5
So, correct answer is D.