Using one or more stacks, write a code segment to read a string of characters and determine whether it forms a palindrome. Definition: A palindrome is a sequence of characters that reads the same both...

Using one or more stacks, write a code segment to read a string of characters
and determine whether it forms a palindrome.
Definition: A palindrome is a sequence of characters that reads the same both forward and
backward.
Example: ABLE WAS I ERE I SAW ELBA.
The character ‘.’ ends the string. Write a message indicating whether the string is a palindrome.
You may assume that the data are correct and that the maximum number of characters is 80.