Anna has six pets and plans to give each one a treat. The treats consist of two identical apple slices, along with one banana, one carrot, one mango, and one pear. Her rabbit refuses to eat the mango, and her parrot refuses to eat the banana. In how many distinct ways can she distribute the treats among the pets?
AABCMP: Available Treats;
Let's freeze six pets in a row so that the treat combination has only to be done.
The Total Way in which AABCMP can be arranged: 6!/2! = 360
Now, we have to remove the constraint cases:
Her rabbit refuses to eat the mango: All the cases where the rabbit was given mango(Freezing Mango for rabbit): 1 * 5!/2! = 60
Her parrot refuses to eat the banana: All the cases where the parrot was given Banana(Freezing banana for parrot): 1 * 5!/2! = 60;
Now, since these two constraints are independent, there are chances that these two occur simultaneously, and which may have been calculated twice, so we have to remove one instance of those: 1 * 1 * 4!/2 = 12
Final distribution: 360 - (60+60-12) = 252
(A) 96
(B) 240
(C) 252(D) 288
(E) 300