Problem 32
(Palindromes) A palindrome is a string that is spelled the same way forward and backward. Some examples of palindromes are "radar, " "able was i ere i saw elba" and (if blanks are ignored) "a man a plan a canal panama." Write a recursive function testpalindrome that returns true if the string stored in the array is a palindrome, and false otherwise. The function should ignore spaces and punctuation in the string.
Problem 35
(Print an array) Write a recursive function printarray that takes an array, a starting subscript and an ending subscript as arguments and returns nothing. The function should stop processing and return when the starting subscript equals the ending subscript.
Problem 37
(Find the minimum value in an array) Write a recursive function recursivellinimum that takes an integer array, a starting subscript and an ending subscript as arguments, and returns the smallest element of the array. The function should stop processing and return when the starting subscript equals the ending subscript.
