How to solve master's theorem?

For this, if we apply master's theorem, I am getting the answer as O(n^3). Please solve this query.

Image icon Screenshot_2017-02-22-20-28-50-605.jpeg

2Comments
abhinandan @abhinandan 22 Feb 2017 09:13 pm

here the recursive equaltion will be t(n)=8t(n/2)+  O(n^3)

now if you will apply the master's theorm then u will get the anser as (n^3)* logn 

Sreeja Mukherjee @bongbirdie 22 Feb 2017 09:24 pm

Got it Thanks :)