How many 3 letter sequences can be formed if the first letter must always be a consonant (not a, e, i, o, u), the second letter must always be a vowel (a,e,i,o,u) and 3rd letter must be different from the first.

A. 2100
B. 4056
C. 3250
D. 2625

I chose A... i guessed

it actully 3250

To find the number of 3-letter sequences that satisfy the given conditions, we can break down the problem into three parts:

1. Selecting the first consonant:
Since the first letter must be a consonant (not a, e, i, o, u), there are a total of 21 consonants in the English alphabet. Therefore, we have 21 options for the first letter.

2. Selecting the second vowel:
Since the second letter must be a vowel (a, e, i, o, u), there are a total of 5 vowels in the English alphabet. Therefore, we have 5 options for the second letter.

3. Selecting the third letter:
The third letter must be different from the first letter. Since we have already selected the first consonant, there are 25 remaining letters (all the consonants + all the vowels except the one chosen in step 1). Therefore, we have 25 options for the third letter.

To get the total number of possible sequences, we multiply the number of options for each step together:

Total = (number of options for the first consonant) * (number of options for the second vowel) * (number of options for the third letter)
= 21 * 5 * 25
= 2625

Therefore, the correct answer is D. 2625.

I chose A...i guessed. Its really hard