JAVA

A word-by-word palindrome is a string of words such that the words read the same forward and backward. For example, the quote "You can cage a swallow, can't you, but you can't swallow a cage, can you?" is a word-by-word palindrome. Write a GUI program to test an input string and tell whether or not it is a word-by-word palindrome. You should use a circular linked list-based queue and an array-based stack in your implementation. Start with a queue and a stack of size 5, and then double their sizes when needed. Consider upper- and lowercase letters to be the same letter. Define a word as any string consisting of only letters or an apostrophe and bounded at each end with one of the following: a space, a punctuation mark. the beginning of the line, or the end of the line. A word-by-word palindrome is a string of words such that the words read the same forward and backward. For example, the quote "You can cage a swallow, can't you, but you can't swallow a cage, can you?" is a word-by-word palindrome. Write a GUI program to test an input string and tell whether or not it is a word-by-word palindrome. You should use a circular linked list-based queue and an array-based stack in your implementation. Start with a queue and a stack of size 5, and then double their sizes when needed. Consider upper- and lowercase letters to be the same letter. Define a word as any string consisting of only letters or an apostrophe and bounded at each end with one of the following: a space, a punctuation mark. the beginning of the line, or the end of the line