A palindrome is a word, phrase, number, or sequence of words that reads the same backward as forward.For example, the following words are palindromes: civic, kayak, rotator. Phrases might have blank spaces.For example, the following phrases are palindromes: top spot, my gym.Complete the non-member method named isPalindrome() which receives a string as a parameter.The method returns true if the string is a palindrome, or false otherwise.For convenience assume that strings are lower case, any whitespace from the string must be removed. 1:In Java, a string s can be stripped of white spaces with the following function call s = s.replaceAll("\\s+", ""); 2:In Java, you can access the character at position i on a string s with the function call s.charAt(i). 3:In Java, the length of string s is given by s.length(); 4:YouMUSTuse astack, implementations that use indices (or pointers) 5: You MUST use this base code. Copy it into your IDE of choice. The code you must try and do is at the bottom with the following message TODO ADD YOUR CODE HERE import java.util.EmptyStackException; import java.util.Iterator; public class Lab07Stack1Wrapper { public static interface Stack { public void push(E newEntry); public E pop(); public E top(); public boolean isEmpty(); public int size(); public void clear(); } public static class SinglyLinkedStack implements Stack { private static class Node { private E element; private Node next; public Node(E elm, Node next) { this.element = elm; this.next = next; } public Node(E data) { this(data, null); } public Node() { this(null, null); } public E getElement() { return element; } public Node getNext() { return next; } public void setElement(E elm) { this.element = elm; } public void setNext(Node next) { this.next = next; } public void clear() { // no need to return data element = null; next = null; } } // instance variables for the stack object private Node header; //Note that this is NOT a dummy header private int currentSize; public SinglyLinkedStack() { header = new Node<>(); currentSize = 0; } @Override public void push(E newEntry) { Node nNode = new Node<>(newEntry, header.getNext()); header.setNext(nNode); currentSize++; } @Override public E pop() { E etr = top(); Node ntr = header.getNext(); header.setNext(ntr.getNext()); currentSize--; ntr.clear(); ntr = null; return etr; } @Override public E top() { if (isEmpty()) throw new EmptyStackException(); return header.getNext().getElement(); } @Override public boolean isEmpty() { return size() == 0; } @Override public int size() { return currentSize; } @Override public void clear() { while (size() > 0) pop(); } } public static boolean isPalindrome(String s) { /*ADD YOUR CODE HERE*/ return false; } }