The time complexity for the the closest pair of points problem using divide$-$and$-$conquer is $\_\_\_\_\_\_\_\_.$

O$($logn$)$

O$(2^$n$)$

O$($nlogn$)$

O$($n$)$