(b) An algorithm process an array of size n in two parts, A and B of equal size. Part A is processed recursively, one element at a time, until a single element remains. Part B is processed recursively by dividing it into three equal parts until it is no longer divisible.
(i) Write a recurrence relationship for the algorithm described above.
(ii) Solve the recurrence relation using the substitution method. Clearly show the steps in the computation.