Recursion problem :$-$

Algorithm RecAVG$($A$,$i$,$j$)$

Input : Array A of size n $,$ indices I and j

If I $=$ j

Return A$[$i$]$

End if

Mid i $+$ j $)/2]$

V RecAVG$($A$,$I,Mid$)$

V RecAVG$($A$,$mid$+1,$j$)$

Avg V$1+$ V$2$

Return Avg $/2$

End Algorithm

$1$ state the base and the recursive cases

$2$ Draw the corresponding recursion tree when RecAVG$($A$,0,3)$ is invoked given that A $=[10,6,2,4].$

$3-$ Determine the running time in terms of n

$4$ determine the space complexity in terms of n