A palindrome is a string of characters that reads the same from left to right as it does from right to left. Write a function called checkPalindrome that takes a string and evaluate if the string is a palindrome or not using only a stack and a queue data structures. You should make use of the built-in java implementation of the stack and queue data structure under java.util.Stack and java.util.Queue. Example 1: Input: s1 - "radar" Output: true Example 2: Input: si = "Hit TheRoadJack" Output: false -Function Template import java.util.Stack; import java.util.LinkedList; import java.util. Queue; public class Lab4 { public static void main (String[] args) { String si = "radar"; boolean ans - checkPalindrome(s1); System.out.println(ans); // Should be True } public static boolean checkPalindrome(String s1){ Stack(); Queue q = new LinkedList(); // Example of stack push S.push("r") // Example of stack pop s.pop() // Example of queue enqeue 9.add("r") // Example of queue dequeue 9.poll() s.isEmpty()) // Check if stack or queue is empty 9. i sEmpty() // INSERT YOUR CODE HERE }