Write a program Embedded Words that finds all English words that can be formed by taking some subset of letters in order from a given starting word. For example, given the starting word happy, you can...

Write a program Embedded Words that finds all English words that can be formed by taking some subset of letters in order from a given starting word. For example, given the starting word happy, you can certainly produce the words a, ha, hap, and happy, in which the letters appear consecutively. You can also produce the words hay and ay, because those letters appear in happy in the correct left-to-right order. You cannot, however, produce the words pa or pap because the letters—even though they appear in the word—don’t appear in the correct order. A sample run of the program might look like this: