How many words or strings of 12 letters can be formed from the symbols a, a, a, a, b, b, b, b, b, b, b, b provided that no two a's can occur together?

there is only one way to arrange all the eight relative to each other because they are not distinct. we have

now there are nine places to place an (and not more than one in one place).   because we have four symbols, we need to choose four of these nine places to insert an . order does not matter because the are not distinct.

thus there are 1 · c(9,4) ways, or, if we calculate it,

thus there are 126 ways to form such "words."

good bye

step-by-step explanation:

you should at least use a calculater

step-by-step explanation: