In theory I'm done this question, but would like to get it checked. 22) How many permutations of the letters ABCDEFGH contain c) the strings BA and FGH? Answer: 5 objects: BA, C, D, E, FGH. Total: 5! = 120 This is following the example in the book. However, the example only has one cluster (Where a cluster is like BA, or FGH), and all of the book's clusters are in alphabetical order. For something like this, where we have two clusters, and it's BA, not AB, does my method still work?