how to solve this recurrence using Recursion Tree method

Question

T(n) = T(n-1) + n⁴ 

Comments

T(n) = n⁴  + (n-1)⁴ + (n-2)⁴ + (n-3)⁴ + ........... 3⁴ + 2⁴  + 1⁴

---

respected dear sir please post the full answer i am not able to derive it at the i th or kth step/stage

i am getting confused how to write general expression

please post full answer please

Answer 1

See this 

Comments

answer is coming T(n) = O (n⁵ )

---

Yes answer is O(n⁵)

Summation of n^4 was done incorrectly in the above image !!

See this :

---

answer is n^5 ..select the correct answer properly