• Isogram: referred to a word, phrase, or sentence in which no letter of the alphabet occurs more than once. For example; the words “ambidextrously", “endolymphatic", and “unpredictably". • Pangram: A phrase or sentence containing all 26 letters of the alphabet (ideally repeating as few letters as possible). For example; the sentence: “Brown jars prevented the mixture from freezing too quickly". • Palindrome: a word, number, phrase, or other sequence of characters which reads the same backward as forward, such as “madam", “racecar", or “Was it a car or a cat I saw". Problem: Write a Java program that asks the user for a word, phrase, or sentence and checks whether his input data is an isogram, a pangram, a palindrome, or none of these. Notice a phrase can be a combination of isogram and pangram; such a phrase is called perfect pangram; for example: “Mr. Jock, TV quiz PhD., bags few lynx". Your program should also recognize if the given word/phrase is a palindrome that is pangram too (i.e.; a palindromic pangram). Your program should allow the user to have as many attempt as they wish. The user must have at least one try. Check the following Figures for sample runs.