Question

How many different five-letter strings can be formed from the letters A, B, C, D, E (repeats allowed) if the first letter must be a vowel and the last letter must be a consonant?

Answer 1

Well, there are 2 choices for the first letter, then 5 choices for each of the 2nd, 3rd, and 4th letters, and then 3 choices for the last letter. Can you think of how that would look in a tree diagram? (You don't have to actually MAKE the tree diagram - just think about how many different outcomes it would give rise to).

Answer 2

2*5*5*5*3=750

Answer 3

:)