In Example 13.5, Laplace’s law of succession, suppose that, among the first m balls drawn, r are red and m − r are white. Using computer simulation, find the approximate probability that the (m + 1)st...

In Example 13.5, Laplace’s law of succession, suppose that, among the first m balls drawn, r are red and m − r are white. Using computer simulation, find the approximate probability that the (m + 1)st ball is red.

Example 13.5

Suppose that u urns are numbered 0 through u−1, and that the ith urn containsi red and u−1−i white balls, 0 ≤ i ≤ u−1. An urn is selected at random and then its balls are removed one by one, at random and with replacement. If the first m balls are all red, write an algorithm to find by simulation an approximate value for the probability that the (m + 1)st ball removed is also red.