Each of 15 bars can be given to any of 10 children, so by orderd sampling
with replcement formula we have 1015
combinations
(d)
To count amount of suitable combinations, we can subtract amount of
combination, where at least one child doesn’t get any bars (is example
of inclusion-exclusion usage case) from total amount of combinations. 1015−∑9i=1(−1)i+1(10i)(10−i)15