Consider the finite strings of length 100 drawn from the alphabet of 4 letters {a, b,c, d}. How many of those strings use no more than two different letters?

Step-by-step explanation:

length of finite strings = 100

number of letters : 4 { a,b,c,d }

Determine the number of strings that use ≤ two different letters

since the number of letters is 4 and we are allowed to make use of at most 2 different letters

Then the number of ways will be : = 6 ways

now considering the length of the Finite strings

The number of strings that use no more than two different letters

=

i am currently in the exact same situation rn. algebra2/adv algebra is killing

step-by-step explanation: