If the hypergeometric mean is less than 1, discuss alternative methods for generation. (Hint: Consider inversion with probabilities computed recursively from 0.)  In Algorithm B3 for sampling, the...

If the hypergeometric mean is less than 1, discuss alternative methods for generation. (Hint: Consider inversion with probabilities computed recursively from 0.)

 In Algorithm B3 for sampling, the minimum index m must be recomputed every time Ui > Um. How much work will this entail?