It wouldn't let me post, so I screenshotted:
....................
2 answers:
Answer:
<em>C:</em><em> </em><em>is</em><em> </em><em>co</em><em>rrect</em><em> answer</em>
<em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em>
<em></em>
You might be interested in
Answer:
151200
Step-by-step explanation:
We can start by essentially taking off the E at the end, meaning that we want to find all the combinations of
EVANESCENC. We can do this because the combinations will have an E at the end by default.
To solve this, we have to figure out the amount of letters and the amount of each letter. There are 10 letters, with 3 E's, 2 C's, 2 N's, 1 S, 1 V, and 1 A. Using the formula , with n representing the amount of letters and each subset of n representing the amount of each letters, our answer is