Problem $1$ Computational Complexity: $(15$ pts$)$

For each function $f(n)$ below, find an asymptotic upper bound using "big$-$Oh$"$ notation. You should give the tightest bound possible. Write your answers and explanations as comments.def func$2($n$,$ m$)$: for i in range$($m$-100)$: for j in range$($n$//2)$: print$($i$+$j$)$

def func$3($n$,$ m$)$:

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

i $=1$

while i m:

print$($i$*$j$)$

i $+=10$

for i in range$($n$//2)$:

for j in range$(100)$:

print$($i$+$j$)$