InterviewBit Problems   NESTED_CMPL3 : Unsolved

I have a query regarding nested loop question here. Why are we not multiplying th (4)
The following code returned 1094 for N is 10 (2)
Awesome Question. Got it! (1)
Darn, the explanation makes it simple. It is indeed O(N). Just because sum of (1/ (1)
Shouldn't this be O(N*log(N))? (3)
Why not O(N*LOG N)? Can anyone explain this? (1)
I toot think it is O(nlogn) (1)
O(N*log(N)) it seems to me (1)