1. 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.

2. Write a function that determines if a string has the same number of 0s and 1s using a stack. The function must run in O(N) time. You can assume there already exists a stack class and can just use it

(Java Please)