Consider a vector with $n$ entries:

$x=\left[\begin{array}{c}{x}_1\\ x_2\\ x_3\\ \text{v}\text{d}\text{o}\text{t}\text{s}\\ x_n\end{array}\right]$

Consider the following python function that calculates that computes the average

of $n$ entries of a $1$D numpy array $x$ :

Code $1$:

def Average$\_$val$\_1($x$)$:

$n=x.$ shape $0$

sum $=x[0]$

for $i$ in range $.$ shape $[0]$ :

sum $=$ sum $+x[i]$

sum $=$ sum $\frac{?}{x}.$ shape $0$

return sum

a$.)$ What is the computational complexity of this function, i$.$e$.$ what is the total

number of operations $($addition$,$ subtraction, multiplications, and divisions$)$ in

this function?