Problem
1. Write a short recursive Java method that takes a character string s and outputs its reverse. So for example, the reverse of "pots&pans" would be "snap&stop".
2. Write a short recursive Java method that determines if a string s is a palindrome, that is, it is equal to its reverse. For example, "racecar" and "gohangasalamiimalasagnahog" are palindromes.