Solve the following recurrences. Give the answer in asymptotic (big-O) notation. You may assume that n is "nice", but be explicit about the exact assumption you make. for example, for question (a), you may assume that n is a power of 2. Make sure that your assumption does not limit how big n can be. T(n) = {1 if n = 1 3. T(n/2) + 5 otherwise T(n) = {1 if n = 1 5. T (n/7) +n otherwise T(n) = {1 if n = 1 8.T(n/2) + n^3 otherwise T(n) = {1 if n = 1 2. T(n - 2) + 1