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