$3$ Palindrome

A palindrome is a sequence that reads the same forwards and backwards. For example, the word

car is not a palindrome because car read forward $($c$-$a$-$r$)$ is different from car read backwards $($r$-$a$-$c$).$

On the otherhand, the word racecar is a palindrome $($r$-$a$-$c$-$e$-$c$-$a$-$r$,$ forwards, is the same as r$-$a$-$c$-$

e$-$c$-$a$-$r$,$ backwards$).$ Write a function that takes in a string as an argument and uses recursion

to check if the string is a palindrome.

Milestone $3$:

To get checked off for this portion of the lab, show correct output from the function using

strings your TA gives you.

For example, if your program contains this code:

System.out.println$($isPalindrome$("$folklore$"))$;

System.out.println$($isPalindrome$("$radar$"))$;

Then your output should be:

false

true