Consider the following statements
$\mathrm{i}$. Number of ways of placing $\text{'}n\text{'}$objects in $k$ bins $k\le n$ ) such that no bin is empty is ${}^{(n-1)}C_{k-1}$ $\mathrm{ii}$. Number of ways of writing a positive integer " $n$ ' into a sum of $k$ positive integers is ${}^{(n-1)}C_{k-1}$ $\mathrm{iii}$. Number of ways of placing ' $n$ ' objects in $k$ bins such that at least one bin is non-empty is ${}^{(n-1)}C_{k-1}$ $\mathrm{iv}$. ${}^{n}C_k-{}^{n-1}C_k={}^{(n-1)}C_{k-1}$

Apply the relevant identity from the chapter and substitute the values established in the previous step, keeping the original constraint in view.

Use the simplified expression to isolate the unknown, then plug the result back into the question setup to confirm the working is internally consistent.

Cross-check against a boundary or limiting case. Both the dimensional balance and the qualitative behaviour at the extreme should agree with the candidate answer.

Combine the steps above to identify the correct option. The remaining choices each fail at least one of the consistency, dimensional, or boundary checks.