Question $2$: $(10$ Marks$)$ Divide and Conquer

Consider the problem of Binam Search Tou are required to wes the Divide and conquer strategr to find out if a given integer, $x=12,$ exists in the set of sorted intrgers

Qhorgs

$-22,-12,-7,-1,1,5,10,15,23$

$i=0,$

$($a$)[4]$ Write down o pseudo$-$Algorithm to solve the probler

$($b$)[6]$ Trace your algorithm using the above set of numbers.

$\backslash$table$[[$location$,i,j,k,$while,$m,$If statement$],[,,,,,,],[,,,,,,],[,,,,,,],[,,,,,,],[,,,,,,],[,,,,,,],[,,,,,,],[,,,,,,]]$

$($c$)$ State the time complexity: