Please us this an example template to create binary search Function.

#include

using namespace std;

int linear_search(int, int [], int);

int main() {

const int arraySize = 5;

int myArray[arraySize] = {3,4,6,2,8};

int value;

cout

cin >> value;

if(linear_search(value, myArray,arraySize) != -1){

cout

cout

}

else

cout

return 0;

} // end main

int linear_search(int x, int a[], int n){

int i = 0, location;

while(i

i = i + 1;

}

if(i

location = i;

else

location = -1;

return location;

}

The pseudocode below describes the binary search algorithm. Use the pseudocode to write a C++ program that implements and tests the binary search algorithm. Note: YOU MUST FOLLOW THE STEPS IN THE GIVEN PSEUDOCODE. DO NOT USE ALTERNATIVE ALGORITHMS. Pseudocode: The Binary Search Algorithm 1 procedure binary search (x: integer, 41,42,..., an: increasing integers) 2 i:= 1{i is left endpoint of search interval) 3j := n (j is right endpoint of search interval) 4 while i am then i := m + 1 7 else j := m 8 if x=d; then location := i 9 else location := 0 10 return location (location is the subscript i of the term an equal to x, 11 or 0 if x is not found)