Using a recursion tree, show the process how to solve the following recurrence in terms of the big O representation. Use the substitution method to prove your conclusion.

T(n) = 2T(n/3) + cn