if possible due in java please ! explain and do properly

1. (100 points) Given a string, write a recursive function that checks if the given string is a palindrome or not a palindrome. A string is said to be palindrome if it reads the same backward as forward. Examples: civic, radar, level, rotor, kayak, reviver, racecar, madam, and refer. However, "paper", "computing", "algorithm" are not. Hint. The idea is to take 2 pointers pointing at the first character and the other at the end character and check if both characters are equal. If so, we check if the substring obtained by incrementing the first pointer and decrementing the second one is also palindrome. If a mismatch happens between any comparison we can then say that the given string is not a palindrome