Answer:
Step-by-step explanation:
To prove divisibility, we need to factor the divident such that one of its factors matches the divisor.
(I use the notation x|y to denote that x divides y)
(A)

(B)

In this case, it is easier to also factor the divisor to primes:

Both of these factor must be matched in the dividend in order to prove divisibility, and that indeed turns out to be true:

THE ANSWER IS D whoops lol sorry i was in an argument lol
You could roll a 6-sided die 3 times to simulate this. This is a good simulation because it has one side for each possible tool, and each roll is independent, just as selecting the tool with replacement would be.