#include using namespace std;int binarySearch(int [], int, int); // function prototype const int SIZE = 16;int main(){int found, value;int list[] = {34,19,19,18,17,13,12,12,12,11,9,5,3,2,2,0}; // array to be searchedcout << "Enter an integer to search for:" << endl;cin >> value;found = binarySearch(list, SIZE, value); // function call to perform the binary search// on array looking for an occurrence of value if (found == -1)cout << "The value " << value << " is not in the list" << endl;else{cout << "The value " << value << " is in position number "<< found + 1 << " of the list" << endl;}system ("pause");return 0;}//*******************************************************************// binarySearch//// task: This searches an array for a particular value// data in: List of values in an orderd array, the number of COSC 1437 Lab 1 | A. Berrached// elements in the array, and the value searched for// in the array// data returned: Position in the array of the value or -1 if value// not found////******************************************************************int binarySearch(int array[],int numElems,int value) //function heading{int first = 0; // First element of listint last = numElems - 1; // last element of the listint middle; // variable containing the current middle value of the listwhile (first <= last){middle = first + (last - first) / 2;if (array[middle] == value)return middle; // if value is in the middle, we are doneelse if (array[middle] < value)last = middle - 1; // toss out the second half of the array //and search the firstelsefirst = middle + 1; // toss out the first half of the array //and search the second}return -1; // indicates that value is not in the array}

Add code to output the number of lookups (i.e. search comparisons) the program performs. Show the results for the following sample test data: 19, 13, 2, 55.