The first loop runs for "log" time.
Second loop runs for "nahi" time.
Overall running complexity (as loop is inside the loop ,so their run time complexity gets multiplied )= O(nlogn).
So, the desired complexity is O(nlogn) , therefore the run time complexity can be greater than this but can never be lesser than this.
But according to question, Options A,B and D are correct and C is wrong . (we've to find out the wrong option ).
Hence correct answer is C