Determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution using expansion/substitution and upper and/or lower bounds, when necessary. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as (nk) or O(nk log2 n) whenever possible. if the algorithm is exponential just give exponential lower bounds. 3. T(n)-T(n-4) + cn, T(0)c 4. T(n) - T(n-1) + T(n-4) + clogzn, T(0)- c' 5. T(n) 3T(n/3) c, T(1)