Write the code in C/C++

Q. Implement the binary search The pseudocode of binary search algorithms is given below: Procedure binary_search sorted array size of array value to be searched A n x Set lowerBound = 1 Set upperBound = n while x not found if upperBound < lowerBound EXIT: x does not exists. set midPoint = lowerBound + (upperBound if A [midPoint] < x set lowerBound midPoint + 1 if A [midPoint] > x set upperBound midPoint - 1 if A[midPoint] = x EXIT: x found at location midPoint end while end procedure lowerBound) / 2