The Hit-Miss Method: Suppose $g$ is bounded in $[0,1]-$ for instance, suppose $0 \leqslant g(x) \leqslant b$ for $x \in[0,1]$. Let $U_{1}, U_{2}$ be independent random numbers and set $X=U_{1}, Y=b U_{2}$ -so the point $(X, Y)$ is uniformly distributed in a rectangle of length 1 and height $b$. Now set
$$
I=\left\{\begin{array}{ll}
1, & \text { if } Y<g(X) \\
0, & \text { otherwise }
\end{array}\right.
$$
That is, accept $(X, Y)$ if it falls in the shaded area of Figure $11.7$.
(a) Show that $E[b I]=\int_{0}^{1} g(x) d x$
(b) Show that $\operatorname{Var}(b I) \geqslant \operatorname{Var}(g(U))$, and so hit-miss has larger variance than simply computing $g$ of a random number.