$4)$ Apply the Little Master Theorem to solve that

equation.

Answer$-$

T$($n$)=$ T$($n$/$b$)+$

$?$T$($n$/2)+$c

$?$ T$($n$/2)+$ T $($n$/4)+$c

$?$ T$($log$($n$))$

$5)$ Explain whether this algorithm optimal.

Answer $-$

For binary search, Optimal condition will be when initially

first and last position is equal. So that function will be

called only once.

Optimal condition:

First $=$ Last