DeleteOptionB$($A$[0..$N$\_$max$-1],$ n$,$ customer$)$

l $0$; r $$ n $1$

while l $<=$ r do

m $($l$+$r$)/2$

if A$[$m$]=$ customer

while m $<$ n $1$ do

A$[$m$]$ A$[$m$+1]$

m $$ m $+1$

n $$ n $1$

return $0$

else if A$[$m$]>$ customer

r $$ m $1$

else

l $$ m$+1$

print $$This customer is not in the array$$

Carefully go through the algorithm and explain and answer the following question

$1.$ What is the problem size?

$2.$ What is the basic operation?

$3.$ Does the algorithm have a best case and a worst case?

$4.$ Calculate the exact efficiency function, using a summation formula or recurrence

relation as appropriate and showing all steps in the calculation. If the best and worst

cases are different, calculate both functions.

$5.$ What is the efficiency class? $($or classes, if the best and worst cases are different$).$