5. This question does not require coding.

Explain how the binary search algorithm fails to find 10 in thefollowing array:

1,3,5,7,9,14,15,21,26,27

How many operations are needed before the algorithm decides 10is not in the array?

Note: please answer in C++ coding and ASAP