MAC281 Assignment 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 , 21, 22, ..., 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 si 5 m := [(i+j)/2] 6 if x > Am then i = m + 1 7 else j := m 8 if x=d; then location := i 9 else location := 0 return location {location is the subscript i of the term a; equal to x, 11 or 0 if x is not found } 10