3. The closest-pair problem can be posed in m-dimensional space in which the Euclidean distance between two points P 0 = (x 0 1 , . . . , x0 m) and P 00 = (x 00 1 , . . . , x00 m) is defined as d(P 0 , P00) = vuutXm s=1 (x 0 s − x 00 s ) 2 Find the runtime for the brute-force algorithm to find the closest pair in m-dimensional space? Pseudocode is not necessary, just the exact runtime. You should find the total work for pairwise distance over all dimensions. The work for each dimension is constant.