Write a recursive function that checks whether string A is a palindrome or Not. Return 1 if the string A is a palindrome, else return 0.
Note: A palindrome is a string that's the same when read forward and backward.
1 <= |A| <= 50000
String A consists only of lowercase letters.
The first and only argument is a string A.
Return 1 if the string A is a palindrome, else return 0.
Input 1: A = "naman"
Input 2: A = "strings"
Output 1: 1
Output 2: 0
Explanation 1: "naman" is a palindomic string, so return 1.
Explanation 2: "strings" is not a palindrome, so return 0.