$(4$ pts$)$ Identify the basic operation and construct a function $C(n)$ that characterizes the time complexity of the algorithm in i$)$ the best case $($i$.$e$.,$ Cbest$(n))$ and ii$)$ in the worst case $($i$.$e$.,$ Cworst$($n$)).$ Determine the order of growth of Cbest$($n$)$ and Cworst$($n$)$ using $$ notation.

F$004($m$,$ A$[0..$n$-1])$

$//$ Description: $...$

$//$ Input: a positive integer $m$ and an array sorted in ascending order

$//$ Output: the number of array elements greater than $m$

for $i=0ton-1do$

$ifA[i]>m$

return $n-i$;

return $0$;

$(6$ pts$)$ Identify the basic operations and construct a recurrence relation $C(n)$ that characterizes the time complexity of the algorithm. Determine the order of growth for C$($n$)$ by solving the recurence relation.

$Fo0s(n)$

$//$ Input: a positive integer $n$

$)=(1$