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?

YOUR

ANSWER

CORRECT

ANSWER

O$($log$2$N$)$

Checkmark

Checkmark

O$($N$/2)$

O$($N$)$

O$($Nlog$2$N$)$