Write the function ispalindrome(txt). this function takes a string as a parameter and returns the boolean value true if the string is a palindrome, false otherwise. • a string is a palindrome if it is spelled the same both forward and backward. • sentences can also be palindromes, therefore, punctuation, capitalization, and spaces should be ignored. numbers should not be ignored • if the user provides an input that is not a string, program should return the boolean value false

There are several ways to do this, depending on your level of experience and the algorithms you know.  Try this one:

Explanation:

Assuming you know loops, and string arrays, start with isPalindrome(true). Loop through the string, using a counter to keep track of the index location of the last character compared.  So, compare index[0] to index[length -1] (with 1 being the counter variable). Increase the conter by one.  Then compare index[1] to index[len-counter] and so on, keeping in mind that when the index  to compare and the counter for matching are the same, you break the loop and return isPalindrome, which should remain true.  If you come across one that doesn't match, isPalindrome returns false, and the loop is finished immediately.

answer(a) occurs after your prediction;