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...

Please help

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