What is the minimal time complexity class of the following program fragment?

You can assume that $($:$($:body:$)$:$)$ is executed in constant time.

$i,j$:$=0$

while $in-1$

$i$:$=i+1$

while $j10$

$j$:$=j+1$

$($:$($:body:$)$:$)$

end

end

$O(lo{g}_2(n))$

$O(n)$

$O(1)$

$O(n^2)$