Consider the following algorithm which receives as input an array A of size n:

i $1$

while i$<=$ ndo

sum $0$

prod $1$

for j $=1$ to n do

sum $$ sum $+$Aj

for j $=1$ to n do

prod $$ prod $+$ Aj

i $$ i$+1$

State how many times each loop is executed and justify your answer.

$$ Give the running time of the algorithm in $\backslash$Theta notation. Explain how you reached the

answer