Consider a KD$-$tree built from a set S of n one$-$dimensional points. $($Assume that all the points are distinct.$)$ The KD$-$tree is built so that its leaves are the points, i$.$e$.$ it is as deep as possible. Assume the tree has been built. The algorithm to test whether or not a given number is in S runs in time

Group of answer choices

Theta$($log n$)$

O$($log n$)$

O$($n$)$

O$($sqrt$($n$))$