A candy shop puts together two prepackaged assortments to be given to​ trick-or-treaters on Halloween. The feasible set for producing x packages of assortment A and y packages of assortment B has been graphed to the right. For the earnings function Earningsx​y, where Earnings is in​ cents, how many of each assortment should be prepared in order to maximize​ profits? What is the maximum​ profit? 0 600 0 600 x y A coordinate system has a horizontal x-axis labeled from 0 to 600 in increments of 120 and a vertical y-axis labeled from 0 to 600 in increments of 120. A four-sided polygon labeled as the feasible set is formed by a series of line segments and their intersection with the x-axis and y-axis. The line segments are labeled as follows: y equals negative 2 x plus 600; y equals negative x plus 350. The shop should prepare nothing packages of assortment A and nothing packages of assortment B to maximize profit. ​(Type whole​ numbers.) The maximum profit is ​$ nothing. ​(Round to the nearest cent as​ needed.)