Let T(n) be defined as the following recurrence formula:
T(1) = 1; and T(n) = 8T(n/2) + n for all n, n > 1, and n is a power of 2.
Use the substitution method and express T(n) as an asymptotic function of n (find a tight bound, i.e., use Big Theta notation).