Answer:
1260 ways
Explanation:
Given
![Dolls = 8](https://img.qammunity.org/2022/formulas/mathematics/high-school/4brft8e211c0ws181byfkfoh1rtv0hopes.png)
![Boxes = 5](https://img.qammunity.org/2022/formulas/mathematics/high-school/2mt5jbplrwozj598hxg9txrver0u5q8w4n.png)
From the question, we understand that: the boxes are identical; however, the dolls are different.
Since no box can be empty, the following scenario exists:
2, 2, 2, 1, 1
This means that 3 of the 5 boxes will hold 2 dolls each while the other 2 will hold 1 doll each.
So, the number of selection is as follows:
2 of the 8 dolls will be selected in 8C2 ways
2 of the remaining 6 dolls will be selected in 6C2 ways
2 of the remaining 4 dolls will be selected in 4C2 ways
1 of the remaining 2 will be selected in 1C1 ways
1 of the remaining 1 will be selected in 1C1 ways
![Expression: ^8C_2 * ^6C_2 * ^4C_2 * ^1C_1 * ^1C_1](https://img.qammunity.org/2022/formulas/mathematics/high-school/aav3imoghk6sfsqo2bwzmanj0hyjh4jm80.png)
Since the boxes are identical, we have to divide the above expression by 2 to get the number of ways:
![Ways = (^8C_2 * ^6C_2 * ^4C_2 * ^1C_1 * ^1C_1)/(2)](https://img.qammunity.org/2022/formulas/mathematics/high-school/glbiwio0yndxh52zxp5n3w6p24e5ouhnt6.png)
![Ways = (28 * 15* 6* 1 * 1)/(2)](https://img.qammunity.org/2022/formulas/mathematics/high-school/ul0e7e1m6t2w6nc3lee8dd2sf6fu56ryjz.png)
![Ways = (2520)/(2)](https://img.qammunity.org/2022/formulas/mathematics/high-school/s5dv774zey4tx14uhnsyli8ldc4jl8mopc.png)
![Ways = 1260](https://img.qammunity.org/2022/formulas/mathematics/high-school/6803sa9al3ygi5ayvf7ls8p0coyz2f9j2e.png)