Please answer ASAP I will rate thumbs up

01. A word is said to be "abecedarian if the letters in the word appear in alphabetical order. For example, the following are all six-letter English abecedarian words: adempt, adipsy, agnosy, biopsy, dimpsy, Abet Assume words of just one letter are abecedarian. Also, reme to this. Something similar happens with lowercase letters but 'a' is 97. ember 'A'is 65 and the rest of the letters are consecutive (a) Complete the program below to print out The word is abecedarian" when the word is abecedarian and "The word is not abecedarian" when it is not. Do not modify anything from the given code, just add the necessary statements to make it work as specified. (b) What is the first while loop in the given code doing? o Changing all letters to integer numbers. O O o Changing all lowercase letters to uppercase. Changing all uppercase letters to lowercase. Changing all values in the word. Starter code #include #include #include int main(void)t bool isAbecedarian true: char word[201 scanf ("is20", word): 17 reads word from user (max 20 char, it could be lesst) int i 0 (i if while strlen (word)){ && A" word [i]