Java

Write a program that performs the following tasks: Display a friendly greeting to the user Prompt the user for a string Accept that string. Make a copy of the string in which punctuation is removed and all text is upper case. Invoke the recursive palindrome function using the copy $($which will be destroyed$)$ and note the answer. Make another copy of the string, removing both punctuation and spaces. Invoke the recursive palindrome function on that copy and note the answer. If the first test passes, its a strict palindrome. If the first test fails but the second test passes, its an ordinary palindrome. If both tests fail, its not a palindrome.