 Coupon collector's problem

The Coupon Collector's Problem is a classic problem in probability theory and combinatorics. It deals with the scenario where a collector seeks to acquire a complete set of coupons, with each coupon representing a unique item out of a finite collection. Each time a coupon is obtained (through purchase, random selection, etc.), it is equally likely to be any one of the available coupons. ### The Problem 1. **Setup**: There are \( n \) different types of coupons.