How many different strings of length 12 containing exactly five a's can be chosen over the following alphabets? (a) the alphabet {a, b} keyboard_arrow_down solution (b) the alphabet {a, b, c}

Part (A) The required ways are 792.

Part (B) The required ways are 101376.

Step-by-step explanation:

Consider the provided information.

Part (A) The alphabet {a, b}

The length of strings is 12 that containing exactly five a's.

The number of ways are:

After filling "a" we have now 7 places.

For 7 places we have "a" and "b" alphabet but we already select a's so now the remaining place have to fill by "b" only.

Thus, the required ways are:

Part (B) The alphabet {a, b, c}

We have selected five a's now we have now 7 places.

For 7 places we have "b" and "c".

Thus, there are 2 choices for each 7 place that is

Therefore the total number of ways are:

Thus, the required ways are 101376.

step-by-step explanation:

idk the answer i want to say 10 but then it would be equal so try 9 but then yeah so yeah we love edgen

85.560%

step-by-step explanation:

conditional probability is defined as:

p(a|b) = p(a∩b) / p(b)

in other words, the probability that a occurs, given that b has occurred = the probability that both a and b occur / the probability that b occurs.

in this example:

p(turns 64 | turns 44) = p(turns 64 & turns 44) / p(turns 44).

if someone turns 64, they must have already turned 44, so:

p(turns 64 | turns 44) = p(turns 64) / p(turns 44)

on page 42, we see that of the original 100,000, 94944 turn 44, and 81234 turn 64.   therefore:

p(turns 64 | turns 44) = 81234 / 94944

p(turns 64 | turns 44) = 0.85560