$5.$ Give the worst$-$case time complexity of the following code segments, show work and provide reasoning.

i $=1$

while $($i $<=2$n$)\{$

x $=$ x $+1$

i $=$ i $+2$

$\}$

for j $=1$ to $2$n

for k $=1$ to n

x $=$ x $+1$

j $=2$

while $($j $<$ n$)$

j $=$ j$2$

x$=$ x $+1$