Do you know the asymptotic (big 0 ) notations mean? Have you ever used the recursion tree method or solving recurrence relations? Use you favorite method and find asymptotic behavior for the following two recurrence relations assuming the exit condition is T(n)=O(1) for n constant. T(n)=T(2n)+1T(n)=T(2n)+nT(n)=2T(2n)+n