Answer:
In 5040 ways.
Step-by-step explanation:
To solve this problem we will use combination without repetition which means:
C ( n k) = (n₁ k₁) (n₂ k₂) (n₃ k₃) = (4 3) (9 2) (7 3) =
(4 · 3 · 2 / 3 · 2 · 1) (9 · 8 / 2 · 1) (7 · 6 · 5 / 3 · 2 · 1) = 4 · 36 · 35 = 5040
It can be done in 5040 ways.
God with you!!!
<span>42x1176
</span><span>_______
5
that is the anwser
</span>
The answer is 24 but i am not sure for the sample
Answer:
Richard is 24 years old and Teo is 10 years old.
Step-by-step explanation:
