Write a method called isPalindrome() for the linked list class that use both the linked list implementations of a stack and a queue to check if each string stored in the list, is a Palindrome. Remember again that a Palindrome reads the same front to back as back to front examples: kayak, Otto and 123321. Example: ["peep","car","rat", "otto"] will return[true,false,false,true]. Code that does not compile will not be marked. Only the code as provided on e-fundi may be used. The code of the queue and stack may not be altered.