Question $10(10$ points$)$

$$ Saved

What is the best$-$case order of complexity of the following code snippet, in terms of the number of times the output statement is executed?

for $($int $==0O(n(n-1))O(n2)O(n)j=0$;$ji=0$;$i$