Write a method to determine if a string is "almost" a palindrome. To be "almost" a palindrome means that the string will have no more than maxErrs of characters that do not match up forwards and backwards. Remember that a palindrome is a string that is the same forwards and backwards. So "racecar" is a palindrome with zero errors, but "racecat" is "almost" a palindrome, but is not quite because it has one error. If the number of errors does not exceed maxErrors, return zero. Otherwise return the total number of errors. Please note that the strings will ONLY contain lower-case letters with no spaces. Look at the test data for additional examples. The only string commands you are allowed to use in solving this problem are: .length and .charAt.