There are $k$ varieties of objects, each variety consisting of the same number of objects. These objects are drawn one at a time and replaced before the next drawing. What is the probability that $n$ and no fewer drawings will be required to produce objects of all varieties?
The back of my book says the answer is $\dfrac{ \sum (-1)^r~~~ ^{k-1}C_r(k-r-1)^{n-1}} { k^{n-1} }$
Attempt: It is evident that $n > k.$ The problem wants that $n$ and no fewer drawings will be required to produce objects of all varieties.
Thus, there exists at least one variety $V_i, ~1 \le i \le k$ such that all objects from $V_i$ are drawn together in the end only.
I am not sure how to proceed ahead with the inclusion-exclusion principle. Could someone please give a direction. Thanks a lot for your help!