(Solved): Determine a lower bound complexity and upper bound complexity of the running time equation of this ...

Determine a lower bound complexity and upper bound complexity of the running time equation of this problem below To do this you will have to specify the running time equation, $T(n)$, of the program. def $\mathrm{prob}1(\mathrm{L})$ : $s=0$ for $\mathbf{x}$ in L: $s+=$ $s^{?}=10+x$ for $i$ in range(len $(L))$ : for $\mathbf{j}$ in $\mathrm{range}(\mathbf{i}+1,\mathrm{len}(\mathrm{L}))$ : $s+=L[i]?L[j]$ return $\mathbf{s}$ Answer: Empty markdown cell, double-click or press enter to edit. Problem 2 Problem 3 Find the running time equation of this program below and its tight bound complexity $(?)$. $\#$ $\#$ Input: $A$ is a list of numbers, $z$ is a number $\#$ def prob3 $(A,z)$ : $?\begin{array}{l}\text{ output }=[]\\ \text{ for }x\text{ in }A:\end{array}?\begin{array}{c}\text{ for }y\text{ in }A:\\ \text{ return output }\end{array}$ \# \# Input: $A$ is a list of numbers, $z$ is a number \# def $prob3(A,z)$ : output $=[]$ for $\mathbf{x}$ in $\mathbf{A}$ : for $y$ in $A$ : if $x+y=z$ : output. append $(z)$ return output Answer: Empty markdown cell, double-click or press enter to edit. Problem 4 Find the running time equation of foo. def foo(L): if $\mathrm{len}(L)<=1$ : return 1 $\mathbf{s}=?$ for $x$ in $L$ : $s+=x$ remaining $=\mathrm{L}[?$ : len $(\mathrm{L})//2]$ return $s+$ foo(remaining) Answer: