With using queues and stacks $($Chapter $4$ and $5),$ update the following program to show an input string is a palindrome string $($Chapter $6).$

A palindrome is a string that reads the same from both ends.

Lab Exam.pdf

Examples:

Input: str $=$ "geeksforgeeks"

Output: No

Input: str $=$madam$"$

Output: Yes

A sample instruction:

Enter a string str

Create a stack object and a queue object

In a loop, letter by letter of the string str push them in the stack $S$ and enqueue them in the queue $Q$ :

Output: No

Input: str $=$madam$"$

Output: Yes

A sample instruction:

Enter a string str

Create a stack object and a queue object

In a loop, letter by letter of the string str push them in the stack $S$ and enqueue them in the queue $Q$ :

Add in the main program the code of $//$Push characters onto the stack and enqueue them in the queue

$4.$ In another loop, compare the letters poping from the stack and dequeuing from the queue, if they are not the same, break or stop the loop and print that the entered string is not a palindrome. If all the letters poping from the stack and dequeuing from the queue are the same, your code should print the entered string is a palindrome.

Add in the main program the code of $//$ Pop from the stack and dequeue from the queue, comparing characters

$****$