Suppose that, in a divide-and-conquer algorithm, we always divide an instance of size n of a problem into 10 subinstances of size n/3, and the dividing and combining steps take a time in Θ(n2) . Write...

Suppose that, in a divide-and-conquer algorithm, we always divide an
instance of size n of a problem into 10 subinstances of size n/3, and the
dividing and combining steps take a time in Θ(n2) . Write a recurrence
equation for the running time T(n), and solve the equation for T(n).