Write a method named canMakePalindrome that accepts a string parameter and returns true if you can make that string into a palindrome by deleting at most $1$ character, or false if that is not possible.

For this problem, a palindrome is defined as a string that contains exactly the same sequence of characters forwards as backwards. For example, "madam" and "abba" and "racecar" are palindromes. The empty string and all one$-$character strings are also palindromes by our definition.

If a string that is already a palindrome is passed, you should return true, such as the call of canMakePalindrome$("$racecar$").$ You should also return true if the string would be a palindrome after the removal of a single character, such as "raycecar" $($remove the $\text{'}$y$\text{'})$ or "abxa" $($remove the $\text{'}$x$\text{'}).$