Question: Given an alphabet = {a, b, c}. How many strings of length 5 are in *, such that each string contains three a's, one b
Given an alphabet = {a, b, c}. How many strings of length 5 are in *, such that each string contains three a's, one b and one c?
Options:
60
20
36
12
PLEASE explain how you solved the problem, i.e. what principle/formula you used
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
