Double Palindrome problem: A palindrome is a string that reads the same forward and backward. The classic examples are mom, level, madam, rotator, etc. A double palindrome is a string that has two palindromes back to back. These are somewhat artificial and may not exist in any language. For example, strings like mommom, madammadam are double palindromes. Your task is to write a Java program, with a Stack data structure, to detect if a string is a double palindrome or not. You can either assume that the string is read in from the keyboard or hard-coded within the main () of your program. No credit for a solution that does not use Stack.