This question is about using Principle of Inclusion-ExclusionFormula, and has to be used to solve this problem:
How many arrangements of a, a, a, b, b, b, c, c, c haveno adjacent letters the same? (Hint: This is tricky—not a normalinclusion–exclusion problem.)
