This needs to be in C++ code. Can you please include comments next to code so I can see the process of what the code is doing. Thanks.

int binarySearch (int a], int size, int k); Implement a function that uses binary search to find a given value k in an array of integers a whose elements are in increasing order. If the value is found, the function returns the index of the value in the array, otherwise it returns-1. For example, for a = (-2, 4, 5, 6, 8) and k = 1, the function returns -1. For k-5 it returns 2. A declaration of the function is given above. Write your own implementation of binary search; do not use the search function available in the C++ standard library. Write test code that thoroughly tests your function