The teacher wishes to see if her pupils can make sense of words...

The teacher wishes to see if her pupils can make sense of words from which certain letters have been removed. She requires a when[space]key_pressed script that will take a word from the user and display a new word that is the same as the original except that all letters in the second half of the alphabet (n to z inclusive) have been removed. The user should input the word as a single string and the new word that is displayed should be a single string. For example, if the user enters 'rhinocerous' then 'hice' is displayed. One way to think about creating the new word for display is to start with the new word as an empty string and then work through the letters in the original word from first to last, creating the new word incrementally. This might be visualised as in Figure 2. Described image Figure 2 Show description: Figure 2 Recall that, as in Part 4 Activity 4.8, a simple way to check whether a given character is one of a set of specific characters is to check whether it is in a list that has been populated with those specific characters. a.Create and write down an algorithm to solve this problem. You might like to use the ideas above, or alternatives of your own. (10 marks) b.Create a when[space]key_pressed script to implement your algorithm. Depending on your algorithm and the way in which you choose to implement it, you may also decide to have a when_green_flag_clicked script. Take a screenshot of your script(s) and paste it into your TMA document. (11 marks) c.Copy the following table into your TMA document and add to it two tests you would perform to check whether the completed program fulfils the specification. (Several tests might be appropriate: you are only required to add two.) Test number Test purpose Inputs Expected results Word New word displayed 1 No letters in second half of alphabet calf calf 2 3 (4 marks)
Program used isnscratch
Scratch is program used