(Java) C-5.17 and C-5.18 page 222 (60 points): ASSUME STRINGS WITH NO PUNCTUATION OR SPACES. The test application should print the original string in reverse besides testing for palindrome. Hint: can use the textbook example for reversing elements of an array on page 208.

Your code should have appropriate class names, comments, and layout.

C-5.17 Write a short recursive Java method that takes a character string s and outputs its reverse. For example, the reverse of 'pots&pans' would be 'snapstop'. C-5.18 Write a short recursive Java method that determines if a strings is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar and 'gohangasalamiimalasagnahog'. 208 Chapter 5. Recursion Reversing a Sequence with Recursion 4 5 6 8 Next, let us consider the problem of reversing the n elements of an array, so that the first element becomes the last, the second element becomes second to the last, and so on. We can solve this problem using linear recursion, by observing that the reversal of a sequence can be achieved by swapping the first and last elements and then recursively reversing the remaining elements. We present an implementation of this algorithm in Code Fragment 5.7, using the convention that the first time we call this algorithm we do so as reverseArray(data, 0, n-1). 1 /** Reverses the contents of subarray data[low] through data[high] inclusive. */ 2 public static void reverseArray(int[] data, int low, int high) { 3 if (low