How many strings of letters can possibly be formed using the above rules?
Explanation:
Case 1: When the 2nd letter is m:
The 1st letter can be any of the 5 vowels.
The 3rd letter will be any of the 4 remaining vowels (i.e. different from the 1st one).
Number of possible 3 letter combinations = 5 × 4 = 20
Case 2: When the 2nd letter is n:
The 3rd letter will be either e or u.
Number of possible 3 letter combinations = 5 × 2 = 10
Case 3: When the 2nd letter is p:
The 3rd letter will be the same as the 1st letter.
Number of possible 3 letter combinations = 5 × 1 = 5
∴ Total number of possible 3 letter combinations = 20 + 10 + 5 = 35
Hence, option (d).
» Your doubt will be displayed only after approval.
Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.