Write a Java program that checks if a string is a palindrome using a Deque. Your program will output "Yes" if it is a palindrome and "No" if it is not. You must solve this using a Deque class which is implemented using either a Doubly-Linked List (which will also be seen in Lab 1) or an expandable circular array (which can be done using an Array List and modulo functions). The program must run in O(n) time. In this problem you will once again read in lines with a single character in each that will yield a string. We are trying to determine whether this string is a palindrome or not. This time, however, instead of being given a count as the first input, you will not know how many lines of input you will receive and the input will be terminated by a line with more than one character. This termination line will not be used. No given string will contain a space character. The Windows program should be case sensitive, i.e. 'A' and 'a' will not be considered the same. Go to Settings to activate Wir