Recall that a function f expressed in terms that depend on f itself is a recurrence relation. Solving such a recurrence relation means expressing f without terms that depend on f. Solve the following recurrence relations using the unrolling method (also called plug-in or substitution method), and find tight bounds on their asymptotic growth rates. Remember to show your work so that the graders can verify that you used the unrolling method. Assume that all function input sizes are non-negative integers. You may also assume that integer rounding of any fraction of a problem size won't affect asymptotic behavior. S2U,(n 1) - 1 when n > 1, (a) Ua(n) 2 when n = 0. = (b) U6(n) = 3U6(n/4) + n/2 when n > 3, 10 when n = 3