In C
Exercise 8.1 A word is said to be “abecedarian†if the lettersin the word appear in alphabetical order. For example, thefollowing are all 6-letter English abecedarian words.
abdest, acknow, acorsy, adempt, adipsy, agnosy, be?st, behint,beknow, bijoux, biopsy, cestuy, chintz, de?ux, dehors, dehort,deinos, diluvy, dimpsy
a. Describe an algorithm for checking whether a given word(String) is abecedarian, assuming that the word contains onlylower-case letters. Your algorithm can be iterative orrecursive.
b. Implement your algorithm in a function calledIsAbecedarian().
