Use the substitution method to obtain a tight big O upper bound on T(n) defined in each of the following recurrences: I got O(n) as my answer. Is that correct? T ( 1 ) = T ( 2 ) = d , T ( n ) = 3 T ( 3 n ) + d if n > 2 , where d is a positive constant. .