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

if n $<$ N$\_$max

i $0$

while i $<$ n and A$[$i$]<$ customer do

i $$ i$+1$

j $$ n $1$

while j $>=$ i do

A$[$j$+1]$ A$[$j$]$

j $$ j $1$

A$[$i$]$ new$\_$customer

n $$ n$+1$

else

print $$The array is already full$.$

Explain the algorithm and answer the following :

$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$).$