Using the recursive method in problem $3($n$=12)$ and assuming n is the length of the array.

$$ Modify the recursion tree from the previous problem to show the amount of work on each activation and the row sums.

$$ Determine the initial conditions and recurrence equation.

$$ Determine the critical exponent.

$$ Apply the Little Master Theorem to solve that equation.

$$ Explain whether this algorithm optimal.