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 would be happy to . most people on would also love to i'm sure. if you just want someone who has done algebra before and want a little more personal relationship than just begging strangers for , i can certainly be of service. i do have college myself so i might not be 24/7.

i think it would be c

mark brainliest if im right

step-by-step explanation: