"Data Structures"

Code the algorithm given:

The Algorithm to solve this problem is: - Ask the user to enter a sentence. - Read the sentence and store it in a string object. - Start a loop, where you pick every character in the string and store it in a stack and in a queue. - Start a new loop, pop a character from the stack, and remove a character from the queue, and then compare these two characters. If they are the same proceed, else stop and print that the sentence is not a palindrome. - If you reach the end, meaning the stack gets empty and all comparisons are true, then print the sentence that the string is a palindrome.