Algorithm DeleteOptionA$($A$[0..$N$\_$max$-1],$ n$,$ customer$)$ i $0$ while i $<$ n and A$[$i$]!=$ customer do i $$ i$+1$ if i $=$ n print $$This customer is not in the array$$ else while i $<$ n $1$ do A$[$i$]$ A$[$i$+1]$ i $$ i$+1$ n $$ n $1$ Separately for each algorithm in option A$,$ discuss their efficiency. Make sure to follow the steps covered in class and detail your thinking: $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$).$