(The Coupon Collecting Problem) There are m different types of coupons. Each time a person collects a coupon it is, independently of ones previously obtained, a type j coupon with probability Let N...

(The Coupon Collecting Problem) There are m different types of coupons. Each time a person collects a coupon it is, independently of ones previously obtained, a type j coupon with probability Let N denote the number of coupons one needs to collect in order to have a complete collection of at least one of each type. Find E[N].