The program accepts a single character at a time from keyboard. The letter has to a lower case ‘a’ to ‘z’. Your program needs to check this and output a message if the input does not hold these two conditions (single character, and lower case).
You need to declare a string of letters (for instance “str”) which is a sequence of all 26 lower?case letters in alphabetical order.
The program must input the character from the keyboard, determine its place in the string, and make a space in the string for this character, inserting it in the proper alphabetical order in the sequence of letters.
Your program should use a recursive routine to insert the letter in the correct point in the program.
After the string of 26 letters, declare a sequence of 30 null bytes (for instance using the “.space”). This will be expansion space for the string as you insert characters into the alphabetized list, and the list grows longer. When this expansion space is used up, your program must end. It will also end any time that you input the number “0” (“zero”) instead of a small letter.
At any point, you can print the current string (i.e., with as many letter inserts as have been made so far) by inputting capital P from the keyboard.