Solve the recurrence relation USING BACK SUBTITUTION OR RECURRENCE TREE : T(n) = T(n/2) + n 3 . T(1)=1
Solution :