A divide-and-conquer algorithm splits up each problem into 8 instances of size = n/2, and takes 2n2 computations to combine their results. Write the recurrence equation and use the master Theorem to determine the complexity of this algorithm.

Thanks