Write RecursiveSearch with two recursive methods:
int binarySearch(int[] a, int key, int low, int high)— prints each range it examines,look at [0..6], middle a[3] = 23, and returns the index or −1;boolean isPalindrome(String s, int low, int high)— compares the outer characters (ignore case) and recurses on the inside.
main reads n and n sorted integers, then keys to search until a non-number, then words to test until the end of input:
search 31:
look at [0..6], middle a[3] = 23
look at [4..6], middle a[5] = 42
look at [4..4], middle a[4] = 31
found at index 4
Level palindrome: true