Could you show the total running time as a function with n as the independent variable, such as f(n) = 3n^3 + 4n^2 + ... for this block of code:

for (int i = 0; i < n + 100; i++) {

for (int j = 0; j < i * n ; ++j) {

sum = sum + j;

}

for (int k = 0; k < n + n + n; ++k) {

c[k] = c[k] + sum;

}

}

And indicate the running times for each component of the, such as int i = 0, j < i*n, etc. I would like to see how to get to the final Big-O running time step-by-step.