asymptotic complexity of iterative loops [closed]

Question

Hii guys.Someone please have a look at this and tell me if I got it right.

for(i=1;i<=n;i++)

for(j=1;j<=i^2;j++)

for(k=1;k<=j;k++)

printf("welcome");

what is the time complexity? I got it to be O(n^4).

Comments

I am getting $\sum_{I=1}^{n}i^{4}$

---

I did it many times and finally found O(n^5) to be the resulting dominant term in the expansion of summation . Still not sure though

---

https://gateoverflow.in/247729/mit-assignment