The answer is:
Answer:
<u>C. 1.05</u>
if u mark as brainly thatll be cool
(2x-6) + 4(x-3) {distribute 4 out and expand problem}
2x+6+4x-12 {combine like terms}
6x-6 {your answer}
This is just the number of permutations of the set {0, 0, 0, 1, 1, 1, 2, 2, 2}. There are 9 elements in the set, so there are 9! = 362,880 possible ternary strings with exactly 3 each of 0, 1, and 2.
Answer:
i belive it is A (2x)2/3
Step-by-step explanation:
