Question: Please use Java. Thanks (1) (15 pts) Write a recursive method to determine if a character is in a list of characters in O(logN) time.

(1) (15 pts) Write a recursive method to determine if a character is in a list of characters in O(logN) time. Mathematically prove (as we did in class) that T(N) = O(logN). You can assume that this list is sorted lexicographically
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
