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, a,a2,... ,an: - increasing integers) 2 i := 1{i is left endpoint of search interval} 3 j:= n (j is right endpoint of search interval) while i am then i := m + 1 else j := m 5 6. 7 if x=a; then location := i else location := 0 return location {location is the subscript i of the term a; equal to x, or 0 if x is not found} 8 10 11

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates…