Question $3(2$ points$)$

The running time of the below algorithm is $(n^2).$

ALGORITHM mystery$($A$[0.$n$-1])$

for $i=0$ to $n-1$ do

for $j=i$ to $i$ do

print $A[i]+A[j]$

True

False