Use the algorithm below to answer the questions that follow.

Algorithm mystery$($A$)$

Input an array of n integers

Output $????$

value $<--1$

for j $<--2$ up to $3$

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

return value

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 $11$

n$+2$

n$2$

$1$

n$1$

$5$

$2$

$4$

$3$

n$2+1$

n$21$

n$+1$

n

n$2$