function func $1(A,n)$

$/*A=$ array of $n$ integers $*/$

$1.$ if $n20$ then return $(A[1])$;

xlarrfunc$1(A,{|}_{{?}_{?}}3\frac{n}{4_{{?}_{?}}}|)$;

for ilarr${|}_{{?}_{?}}\frac{n}{2_{{?}_{?}}}|$ to ${|}_{{?}_{?}}\frac{n}{2_{{?}_{?}}}|+8$ do

$,$xlarrx$+A[i]$

endfor

return $(x)$;

What is the time complexity of the given recursive function? O$()$

Note: It doesn't matter what this function does. The goal is to practice with the analysis of recursive algorithms.

Note: To solve this problem, first write a recurrence equation for the time complexity for the function, then use the iteration method$/$Master Theorem, to find its Big O order.