Given a sorted array A of n elements, find a recurrence relation for the binary search

algorithm and solve it$.(3$ pts$)$

$($Give a high$-$level design for the algorithm that supports how you set up your recurrence

relation and then show how you found its solution