The closest-pair problem can be posed in k-dimensional space in which the Euclidean distance between two points p'(a'1, ...,*') and p"(x), ..., a) is defined as k d(p', p"') = (u -21) 3. s=1 What is the time-efficiency class of the brute-force algorithm for the k-dimensional closest-pair problem?

The closest-pair problem can be posed in k-dimensional space in which the Euclidean distance between two points p(x1,,xk) and p(x1,,xk) is defined as d(p,p)=s=1k(xsxs)2. What is the time-efficiency class of the brute-force algorithm for the k dimensional closest-pair