You have eight letters \(\displaystyle E_1E_2E_3R_1R_2VMO\). With the subscripts those are are distinct.
So with subscripts there are \(\displaystyle 8!\) ways to rearrange those eight letters.
The letters \(\displaystyle E_1E_2E_3\) can be arranged in \(\displaystyle 3!=6\) ways So if we simply remove the subscripts we have six identical strings.
There are \(\displaystyle \frac{8!}{3!\cdot 2!}\) ways to arrange the letters in \(\displaystyle EVERMORE\) because there are three identical \(\displaystyle E's\) and two identical \(\displaystyle R's\)
Now please reply telling us why \(\displaystyle \frac{11!}{(4!)^2(2!)}\) in the number of ways to rearrange the letters in \(\displaystyle MISSISSIPPI\).