If f(n)=4f(3n/5)+cn^2 , the height of recursion tree is

#1
  1. log5(n)
  2. log4(n)
  3. log5/3(n)
  4. None of the above
    What is the correct answer to the question. Please help me with explanation.
#2

@kodivine0
Do you know master theorem?
image
You can get the time complexities of the recursive function using master theorem.
If you want the proof, you can lookup on the internet you’ll find it.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.