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 8. T(n/2)+n^3 Otherwise T(n)={1 if n=1 2. T(n-2)+1 Otherwise