Answer:
126 ways
Step-by-step explanation:
The formula for combinations is given by:
C(n, r) = n! / (r!(n - r)!)
Where:
- n is the total number of tiles in the bag (9 in this case)
- r is the number of tiles drawn (4 in this case)
- ! represents the factorial function
We take
C(9, 4) = 9! / (4!(9 - 4)!) = 126
So, there are 126 ways to draw 4 tiles from a bag with replacement, where the order does not matter, given that there are 9 tiles in the bag.
