Give the tightest asymptotic upper bound (in 0 () you can obtain for the following recurrences. You can assume T(1) = 1. Justify your answer. [5 pt each Fn) - STUP) +R TAN) 27(1/4) T SVT * - *(it 1) Hogar T(n) = n(T(1/2)) T(n) = T(n/2) + 2n