Now, consider the change problem in Binaryland. The input to this problem is an integer L. The output should be the minimum cardinality collection of coins required to make L cents of change (that is, you want to use as few coins as possible). In Binaryland, the coins are worth 1, 2, 22, 23, ..., 21000 cents. Assume that you have an unlimited number of coins of each type. Prove or disprove that the greedy algorithm (that takes as many coins of the highest value as possible) solves the change problem in Binaryland. HINT: The greedy algorithm is correct for one of the above two problems and is incorrect for the other.

when rotating a figure 180 degrees, imagine that you are able to take the figure and turn it clockwise or counterclockwise around a center point. to rotate a figure 180 degrees, you will need to apply the rule (x, y) → (-x, -y). start by using a coordinate grid with coordinates for each vertex of the figure. the center point of the coordinate grid is located at (0, 0), which is what you will rotate the figure around. write down the original coordinates of the shape you are going to rotate. then, apply the rule. for example, coordinate (1, 2) becomes (-1, -2). another example would be, coordinate (-4, -2) becoming (4, 2). after you change each original coordinate to the rotated coordinate, you will draw your new figure.

step-by-step explanation:

step-by-step explanation: the answer is 27. first multiply .32 by 25 which equals 8. then add 8 to 25 which gives you 33. then you subtract that from 6 since she gave 6 to her brother.

,, add !

segment bisector

step-by-step explanation:

line segment bisector. definition: a line, ray or segment which cuts another line segment into two equal parts. try this drag one of the orange dots at a or b and note the the line ab always divides the line pq into two equal parts.

mark brainliest!