in c++

and example of the output:

please write your own code, dont use one already written.

Write a program to find if the elemnt is present in the array using binary search The list is int list [17]={2,4,7,10,11,28,34,45,50,59, 60,66,69,70,75,89,95}; The prototype of the function is int binarySearch(int array[], int size, int value); Find the number of iterations it took to find for teh following key values 66,69,78 It took 4 iterations to find 66 It took 2 iterations to find 69 It took 4 iterations and found out 78 is not available 66 is at index 11 69 is at index 12 78 is at index 1