The number of red balls in an urn that contains \(n\) balls is a random variable
that is equally likely to be any of the values \(0,1, \ldots, n\). That is,
$$
P\\{i \text { red, } n-i \text { non-red }\\}=\frac{1}{n+1}, \quad i=0,
\ldots, n
$$
The \(n\) balls are then randomly removed one at a time. Let \(Y_{k}\) denote the
number of red balls in the first \(k\) selections, \(k=1, \ldots, n\)
(a) Find \(P\left\\{Y_{n}=j\right\\}, j=0, \ldots, n\).
(b) Find \(P\left\\{Y_{n-1}=j\right\\}, j=0, \ldots, n\)
(c) What do you think is the value of \(P\left\\{Y_{k}=j\right\\}, j=0, \ldots,
n ?\)
(d) Verify your answer to part (c) by a backwards induction argument. That is,
check that your answer is correct when \(k=n\), and then show that whenever it
is true for \(k\) it is also true for \(k-1, k=1, \ldots, n\).