Problem $5$: View the code in the cell below, then answer the questions in the cells that follow.

In $[]$: def example$1($S$)$: # from textbook, section $3\mathrm{.}5,$ page $143$

$"\text{'}""$ Return the sum of the elements in sequence $S.""1"$

$n=$len$(S)$

total $=0$

for $j$ in range $(n)$ :

total $+=S[j]$

return total

P$5,$ Q$1$: What is the $T(n)$ for the above code based on a static analysis? You may use the symbol $\text{'}c\text{'}$ for anything that's constant rather than trying

to estimate the number of operations. For example, $T(n)=cn**2+cn+c$ is a valid function $(n**2$ is $"n-$squared"$).$ We can do that because our

analysis showed that the constant factors are not crucial when measuring the growth rate. Then, the big$-$Oh family of this particular function,

$T(n),$ is $O(n**2)$ based on the $cn**2$ factor.

Put your response in the next cell.

In $[]$:

P$5,$ Q$2$: What is the big$-$Oh family for the above code? Enter the response in the next cell.

In $[]$: