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.

not sure but it may be b, as i said i'm not sure.

answer: integers are just whole numbers: positive, negative, and zero.

i = {-∞, -2, -1, 0, 1, 2, 3, ∞}

let x = 1st integer

let y = 2nd integer

x = 3y + 17   {equation 1}

xy = -24         {equation 2}

substitute 3y+17 in place of x n equation 2

and solve for y.

(3y+17)y = -24

3y2 + 17y = -24

3y2 + 17y + 24 = 0

from quadratic equation:

y = [-17±√(172-4(3)(24))]/(2(3))

y = (-17 ±√1)/6

y = (-17+1)/6   or     y = (-17-1)/6

y = -16/6           or     y = -18/6

y = -2 2/3         or   y = -3

since we are dealing with

y = -3

x = 3y+17 = -9+17 = 8

the integers are -3, 8

step-by-step explanation:

c(x)= 6x + 3

step-by-step explanation:

middle maybe?

step-by-step explanation: