Self doubt

Question

T(n)= T(4n/5)+O(n)... we can't apply master's theorem to solve it???

And if not then how are we going solve this..

Comments

You can do with induction - the answer should be $O(n)$ I am guessing.

---

we can also do it using recursive tree method... answer will be O(n)

---

We can apply tree method-