Given an integer array and a target value, use the binary search algorithm looking for the value, but instead of returning the value's index or -1, return the number of elements you had to access! Note: The integer array is already sorted from least to greatest and you must use binary search to receive credit for this problem.