The teacher wishes to see if her pupils can make sense of words in which certain letters have been duplicated.

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 each consonant has been duplicated. For clarification, the consonants should be considered as: b$,$ c$,$ d$,$ f$,$ g$,$ h$,$ j$,$ k$,$ l$,$ m$,$ n$,$ p$,$ q$,$ r$,$ s$,$ t$,$ v$,$ w$,$ x$,$ y and z$.$

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

$$metal$$

then

$$mmettall$$

is displayed.

One way to create the new word to be displayed 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. If the current letter is not a consonant then we add it to the new word, otherwise we add two of it to the new word.

a$.$Create and write down an algorithm to solve this problem.

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.

Show me this made in scratch.