Time left $2$:$27$:$10$

Question $1$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

What is the order of complexity of the following code fragment as a function of n$?$

x $=$ n;

while $($x $>0)\{$

z $=0$;

while $($z $<=6)$

z $=$ z $+2$;

x $=$ x $-1$;

$\}$

Question $1$Select one:

a$.$

O$($n$)$

b$.$

O$($log n$)$

c$.$

O$($n log n$)$

d$.$

O$($n$2)$