Calculate how many different sequences can be formed that use the letters of the given word. [Decide where, for example, all the s's will go, rather than what will go in each position. Leave your answer as a product of terms of the form C(n, r).] Schizophrenia O c(1, 13)C(1, 12)C(1, 11)C(2, 9)C(1, 7)C(1, 6)C(1, 5)C(1, 4)C(1, 3)C(1, 2)C(1, 1) O C(13, 1)C(12, 1)C(11, 2)C(10, 1)C(9, 1)C(8, 1)C(7, 1)C(6, 1)C(5, 1)C(4, 1)C(3, 1)C(2, 1)C(1, 1) O 13 C(13, 1)C(12, 1)C(11, 2)C(9, 2)C(7, 1)C(6, 1)C(5, 1)C(4, 1)C(3, 1)C(2, 1)C(1, 1) OC(13, 9) C(13, 1)C(12, 1)C(11, 2)C(9, 2)C(7, 1)C(6, 1)C(5, 1)C(4, 1)C(3, 1)C(2, 1)C(1, 1)