(2) Solve the following recurrence relation by using Recursion Trees Method. T(n)=12T(2n)+nIfnIfn>1=1.Read less