We consider permutations of the string ”ABACADAFAG”. How many
permutations are there? How many of them don’t have any A next to
other A? How many of them have at least two A’s next to each other?