In this part, you will use stacks to recognize palindromes. Palindromes are strings that read the same backward as fonNard (for example \"madam"). Write a program to read a line in from the keyboard and print to the display, whether or not it is a palindrome. You MUST use three stacks to implement the program. For simplicity use only lower case letters in your test strings. Use the following logic 1. Push original string onto Stack_1 and also Stack_2 Pop Stack71 and push onto Stack}. until Stacki'l is empty At this point Stack} is the original string and Stack} is the reverse Compare Stack_2 and Stack_3 using dot = If Stack} is equal to Stack} the string is a palindrome Test your string by entering data from the keyboard and writing out to the screen whether the string is a palindrome