Java Program. Please only answer if you understand the problem and please no copy and reposting. Thank you!

Assume that s is a string of characters such that each character belongs to the English alphabet {a, b, c, d, ., x, y, z}.

The string s is called a palindrome if we get two identical strings when we read s forwards and backwards.

Write a recursive function called Palindrome with signature public static Boolean Palindrome (String string1, int first, int last) that returns true if the substring from first to last of string1 is a palindrome or false if string1 is not a palindrome.

Write a java program to test your function.