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.

trapezoid

step-by-step explanation:

first i plotted all my points on a grid graph

i made sure all of them were in the correct quadrant

then i saw it was a trapezoid or a quadrilateral

y = 5x + 17

step-by-step explanation:

a perpendicular line will be the opposite reciprocal slope of the given equation.   the slope given is -1/5 so the opposite reciprocal is 5

find b:

7 = 5 (-2) + b

7 = -10 + b

17 = b

write equation

y = 5x + 17

the ratio of grapes to blueberries she should use is 12: 3

step-by-step explanation:

if mandie is making 15 cups of fruit salad, the ratio of grapes to blueberries she should use is 12: 3.