2. Solve the recurrence T(n) = 2T) +3n using the iteration method. Give an exact answer in terms of n. Also, give a good asymptotic Big-O upper bound. Assume that T(1) = 1. Show all your work for obtaining the eract answer, and fill in the blanks below. (If you didn't print the test, then make sure that you answer the ques- tion as if you were writing it on the printed page, including filling in the blanks at the bottom of the page.) (You do not need to show how you obtained the good asymptotic Big-O upper bound from the exact answer.) Exact answer in terms of n: Good asymptotic Big-O upper bound