In order to receive the points, you must provide me a very detailed solution. I would very much like to be able to understand the problem and the solution. Thank you. Supposed 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 theta (n2). Write a recurrence equation for the running time T (n), and solve the equation for T (n).