How may I find the time complexity of the following code:

*(Sorry for adding image, I will re-edit my question once I have access to the laptop)*

[![enter image description here](https://i.stack.imgur.com/C45lt.png)](https://i.stack.imgur.com/C45lt.png)

**What I have done so far:**

The first loop iterates n times, the second i times and the third log(i\*j) times, So after simplifying I got:

Sigma from i=0 to n for i\*log i + n \* (Sigma from j=0 to i for log i)

But why this is equal to O(n^2 log(n))?