Show that the factor λ 0 /(λ 0 + λ 1 ) in the upper bound on the average number of computations per branch for the stack algorithm (Theorem 7.5) regarded as a function of the bias B achieves its...

Show that the factor λ₀/(λ₀
+ λ₁) in the upper bound on the average number of computations per branch for the stack algorithm (Theorem 7.5) regarded as a function of the bias B achieves its minimum for B = R, that is, for the Fano metric.