$3.$ Draw the recursion tree when n $=12,$ where n represents the length of the array, for the following recursive method:

int sumSquares$($int$[]$ array, int first, int last$)\{$ if $($first $==$ last$)$

return array$[$first$]*$ array$[$first$]$;

int mid $=($first $+$ last$)/2$;

return sumSquares$($array$,$ first, mid$)+$ sumSquares $($array$,$ mid $+1,$ last$)$;

$\}$