In a tic-tac-toe game, each of the nine squares can either be blank, or have an x or an o, so in playing tic-tac-toe there are 39 states. if x wins after 9 turns, there will be 9 ways to place the first x, 8 ways to place the next o and so on, giving 9 · 8 · · · · 1 = 9! different 9 move tic-tac-toe games in which x wins. which of these computations is done correctly with the multiplicative principle? how is independence satisfied or violated?