Indicate whether $f=O(g),f=(g),$ or $f=(g).$

$f=n^{10},g=n^{20}$

$f=2^n,g=(\frac{3}{2}{)}^n$

$f={10}^{lo{g}_2(n)},g=n^{lo{g}_2(10)}$

$f=\sqrt[\phantom{2}]{2}{?}^{lo{g}_2(n)},g=\sqrt[\phantom{2}]{n}$

Determine the big$-$O complexity of func$1$ in terms of $M$ and $N.$ A and $B$ are $M$ length

and $N$ length arrays respectively.

Algorithm $1$: func$1$

def func$1(A,B,M,N)$ :

buildMaxHeap $(B)$

for $iin$ range $(M)$ :

$j=N$

while $j>0$ :

$B[j]=A[i]+j+i$

$j=flr(\frac{j}{10})$