What is the optimal time required for solving the closest pair problem using divide and conquer approach?

What is the optimal time required for solving the closest pair problem

1.	What is the optimal time required for solving the closest pair problem using divide and conquer approach?
A.	O(N)
B.	O(log N)
C.	O(N log N)
D.	O(N2)
Answer» D. O(N2)