There are N distinct types of coupons, and each time one is obtained it will, independently of past choices, be of type i with probability Pi, i = 1, . . . ,N. Let T denote the number one need select to obtain at least one of each type. Compute P{T = n}.