Consider the Palindrom class discussed in class. Which of the following is true? It uses one stack and one queue to find out if a given string is palindrom It uses a glass queue to find out if a string is a palindrome It uses a recursive method to find out if a string is a palindrome It uses 2 stacks to find out of a string is a palindrome

It uses a recursive method to find out if a string is a palindrome

Explanation:

Palindrome is a word or a sequence which is read same as backward as forwards. There are various method to find a palindrome. Palindrome can be determined recursively by identifying the first and last letters of the word. These first and last letter should be same. If they are same then the word or sequence is palindrome.

are there any graphs invested in this equation