1. USE a Java recursive method called minArray for finding the minimum element in an integer array.
2. USE a Java recursive method called countVowels that returns the number of vowels in a given String.
3. USE a short recursive Java method called isPalindrome that determines if a String s is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and '01100110'.

1. What is returned by the following recursive calls?

public int mystery(int n, int b) {if (n/b == 1) { return 1; }else { return mystery(n/b, 1) + 1; }}

1. mystery(2, 2)
2. mystery(4, 2)
3. mystery(33, 2)
4. mystery(100, 2)
5. mystery(1000, 10)