Analyzing algorithms for time complexity?

Your thought process is correct. You need to replace the j term with an n (n being the largest value j can assume), but that is probably a typo.

Computation in this particular example could be simplified if you can find out that all three loops has the same exit condition up to n.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.