Answer:
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: