The "value per pound" greedy strategy didn't work to solve the 0-1 knapsack problem. Would the "price per inch" greedy strategy work for the rod-cutting problem? Price-per-Inch Strategy: Given a rod of length n, first cut off a piece of length i, where 1

Consider the ellipse defined below: +2²=1. 4 Do the taks specified in the coding cell below. % To do: generate 1000 points evenly on the ellipse T % To do: Rotate the above points by 45 degrees counterclockwise % To do: Plot both ellipses in the same figure

TASK 1: Swap Brightest and Darkest Colors (15 – 20 min) Create a function LightDark which identifies the brightest color of a given image (closest to white) and swaps that color with the darkest color of the image (closest to black). HINT: The brightness of a color is proportional to the sum of its RGB values.

Let A = |2153|. If A-1 = |abcd|, then a + b + c + d =