$12\mathrm{.}8\mathrm{.}1$: Simulating binary search.

help$\_$outline

The input list of binary search is:

$(2,5,8,10,13,19,21,32,37,52)$

For each target value x given below, give the values for variables low and high for each call to BinarySearch. Then give the final value return value.

$($a$)$

x$=13$

$($b$)$

x$=1$

$($c$)$

x$=35$

$($d$)$

x$=52$