A word is said to be "abecedarian" if the letters in the word appear in alphabetical order. For example, the following are all 6-letter English abecedarian words: abdest, acknow, acorsy, adempt, adipsy, agnosy, befist, behint, beknow, bijoux, biopsy, cestuy, chintz, deflux, dehors, dehort, deinos, diluvy, dimpsy Write a Java program and method called IsAbecedarian that check to see if a word of any size entered from the keyboard is abecedarian or not. Assume the word entered is a legal word. Output should be user friendly.With comments.