Describe an efficient algorithm that, given a set \{x_1, x_2, \ldots, x_n\}{x 1 ,x 2 ,…,x n} of points on the real line, determines the smallest set of unit-length closed intervals that contains all of the given points. argue that your algorithm is correct.

equal to

step-by-step explanation:

a function could be identified in 3 ways either on a chart,graph, or ordered pairs. first a function is that each point has its own. the rule is that there can be many x's to one y but there can not be 2 x's at different y's. so on a graph when you put a straight line through the y's there should be one dot only to be a function.

step-by-step explanation:

b) k’(6, 4); l’(3, 3)

step-by-step explanation:

a 270° clockwise rotation maps every point (x, y) to (y, -x). (it negates the x-coordinate and then switches it and the y-coordinate.)

this means the endpoints of the side congruent to kl, k' and l', would be mapped as:

k'(-4, 6)→(6, 4)

l'(-3, 3)→(3, 3)

they charge the same amount at 20 minutes.

step-by-step explanation: