A talented student named Sarah devises a different algorithm B that partitions the uncertainty interval into three

equal parts and outputs the rightmost point of the first part. For example, if the uncertainty interval is $(0\mathrm{.}5,0\mathrm{.}62],$

B returns hB $=0\mathrm{.}54.$ Specify whether the analysis we saw in the class for A also applies to B or not $($without any

modification$).$ That is$,$ whether the sample complexity of B can be bounded by $1$

$$ ln$(2$

$\backslash$delta $)$ as we saw in Slide $12.$ Justify

your answer in a few sentences.