in java

Binary search finds the position of a key element in a sorted array. The algorithm compares the key to the middle element of the array. If the element in the middle is great than the key, the algorithm continues the search on right half of the array. If the element is the middle is less than the key, the algorithm continues the search on left half of the array. If they are equal, the algorithm returns middle index. Otherwise, the algorithm returns negative one. A. (5) Develop a binary search pseudo code. B. (5) Write a recurrence T (n) of binary search where n is a number of elements in array and solve your recurrence function