please help

C 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 , aj,a.....an: increasing integers) i := 1fi is left endpoint of search interval 3 j = n {j is right endpoint of search interval) while i a,. then i:= m + 1 7 else i := m 8 ir r=d; then location := 1 9 else location := 0 10 return location [location is the subscript i of the term an equal to x. or 0 if x is not found)