Rearrange Letters
If \(W\) is a word consisting of some English letters then let \(X\) be the number of ways to rearrange the letters of \(W\) such that no two adjacent letters are the same. For example if \(W =\) `ROSS' then \(X = 6\) because the valid rearrangements are:
`RSOS', `OSRS', `SROS', `SORS', `SRSO' and `SOSR'
| Part A | If \(W = \) `GUSTYGAMES' then find \(X\). | |
|---|---|---|
| Part B | If \(W = \) `ABRACADABRA' then find \(X\). |