The closest-pair problem can be posed in the k-dimensional space, in which the Euclidean...

The closest-pair problem can be posed in the k-dimensional space, in which the Euclidean distance between two points is defined as

What is the time-efficiency class of the brute-force algorithm for the k-dimensional closest-pair problem?