Given this pseudocode:Given this pseudocode that extracts a sample sequence from the data sequence of length N:

$$

Function Sampler $($Sequence Data$)$

$$Set Sample to an empty sequence

$$Set N to the length of Data

$$While N$>=1$

$$Append element N of Data to Sample

$$N:$=$ N$/2$

$$Return Sample

$$

What is the worst$-$case run time for Function Sampler?

S $=\{2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20\}$

x $=2$

While$($x$<11)$:

$$For i in S:

$$ If $0$ i mod x and i $$ x:

$$delete i from S

$$ end$-$If

$$end$-$For

$$ x $=$ x $+1$

end$-$While

What is S at the end of this code?