Use the algorithm below to answer the questions that follow.

Algorithm mystery$($A$)$

Input an array of n integers

Output $????$

value $<--$ A$[$n$-1]2$

for j $<--0$ to n$-1$

value $<--$ value $2$ A$[$j$]$

for k $<--0$ to j

value $<--$ value $$ A$[$j$]$ A$[$k$]$

value $<--$ value $($A$[$j$]-2)($A$[$k$]+2)$

return value $3$

Select the function $($in terms of n$)$ that represents the worst$-$case number of diamond $()$ operations performed in the algorithm above.

Multiple choice $1$ Question $7$

n$24$n$+1$

$3$

n$2$n$1$

n$22$n$1$

$2$n$2+4$n$1$

$2$n$2+4$n$+2$

n$3+4$n$2+1$

$2$

$1$

$4$n$3+2$n$2$

n$2+2$n$+3$

$5$

n$3$

$4$

n$22$n$2$