Question IV$.(10$ points$)$

Write a recursive implementation of the binary search function. Your function parameters

should include an integer array and parameters you need to keep track of the range of the part

of the array you are searching. Note: You will need to pass more parameters for the recursive

function than we needed for the iterative implementation, because we need to pass some

information that was previously saved in local variables.

All in C$++.$

$$If something looks off, it might have been scanned wrong by chegg. Please refer to the image instead. Thank you. Comments that explain the code simply would be appreciated