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 don't understand the question
The interest is $35 so it ends up costing her $70
Step-by-step explanation:
not sure but i thibj the second one