View the step-by-step solution to:


program accept  a single-letter keyboard input at a time. The letter inputs must

be lower case a through z (no upper-case or non-letter characters allowed; only lower-case letters). Only one letter must be input at a time; make sure that the character is ONLY a lower-case letter.

In the data declaration, declare an alphabetized string of letters (named "str"), a-z.

The program must input a 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.

After the alphabetized string of 26 letters, declare a sequence of 30 nulls (using the ".space" directive), as expansion space for the string as you insert characters into the alphabetized list.

At any point, you can ask to print the current string (i.e., with as many letter inserts as have been made so far) by inputting capital P from the keyboard.

Finally, this program MUST use a recursive routine to insert the letter in the correct point in the program. Actually, using recursion is not the only way to accomplish this programming task, but it does make it relatively straightforward.

Remember to store the contents of $ra on the stack each time you jal, since your program may call itself quite a few times as it finds the correct location for each input letter

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Let our 24/7 Electrical Engineering tutors help you get unstuck! Ask your first question.
A+ icon
Ask Expert Tutors You can ask You can ask ( soon) You can ask (will expire )
Answers in as fast as 15 minutes
A+ icon
Ask Expert Tutors