We want to build 12 letter words using only the first n = 10 letters of...

Transcribed Image Text:

We want to build 12 letter “words" using only the first n = 10 letters of the alphabet. For example, if n = 5 we can use the first 5 letters, {a, b, c, d, e} (Recall, words are just strings of letters, not necessarily actual English words.) a. How many of these words are there total? b. How many of these words contain no repeated letters? c. How many of these words start with the sub-word "“ade"? d. How many of these words either start with "ade" or end with "be" or both? e. How many of the words containing no repeats also do not contain the sub- word "bed"? We want to build 12 letter “words" using only the first n = 10 letters of the alphabet. For example, if n = 5 we can use the first 5 letters, {a, b, c, d, e} (Recall, words are just strings of letters, not necessarily actual English words.) a. How many of these words are there total? b. How many of these words contain no repeated letters? c. How many of these words start with the sub-word "“ade"? d. How many of these words either start with "ade" or end with "be" or both? e. How many of the words containing no repeats also do not contain the sub- word "bed"?

Answer rating: 100% (QA)

a Total words 1012 1000 000000 000 3D Since the length of word in 12 and each p... View the full answer