Problem
Suppose that, in a divide-and-conquer algorithm, we always divide an instance of size n of a problem into n sub instances of size n/3, and the dividing and combining steps take linear time. Write a recurrence equation for the running time T(n), and solve this recurrence equation for T(n). Show your solution in order notation.