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