Use the algorithm below to answer the questions that follow.

Algorithm mystery$($A$)$

Input an array of n integers

Output $????$

value $<--0$

for j $<--1$ up to n$-2$

if A$[$j$]\%2=1$ then

value $<--$ value $+316$ 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 $10$

$4$

$5$

n$1$

n$+2$

$3$

n$2$

n$21$

$1$

n$2+2$

n$2$

$2$

n$+1$

n