Answer
$C(11,1)*C(10,1)*C(9,1)*C(8,1)*C(7,1)*C(6,1)*C(5,2)*C(3,3)$
Work Step by Step
We have to find the total number of sequences that can be formed using the letters of the word Megalomania.
It has 11 letters. (1e,1g,1l,1o,1n,1i,2m,3a,)
The total number of 11-letter sequences of those letters is $C(11,1)*C(10,1)*C(9,1)*C(8,1)*C(7,1)*C(6,1)*C(5,2)*C(3,3)$
Because first we choose where to put the e in the sequence, then the g, (we can't put it where the e is, and we go on.
