How would I solve this. Please explain each step. And I what is the best and fastest way to find the cornerpoints. Especially on a TI-85 calculator

9. [5/11 Points] DETAILS PREVIOUS ANSWERS WANEFMAC8 6.2.028.EP. MY NOTES Enormous State University's Business School is buying computers. The school has two models from which to choose, the Pomegranate and the iZac. Each Pomegranate comes with 400 GB of memory and 80 TB of disk space; each iZac has 300 GB of memory and 100 TB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 48,000 GB of memory and at least 12,800 TB of disk space. If the Pomegranate and the iZac cost $2,000 each, how many of each should the school buy to keep the cost as low as possible? (If an answer does not exist, enter DNE.) Let x = number of Pomegranates, let y = number of iZacs, and let c = cost (in dollars). Determine the objective and the constraints needed to solve the problem. Objective minimize C = 2000x + 2000y Constraints 400x + 300y 2 48,000 80x + 100y 2 12,800 x20, y20 Graph the feasible region and determine the coordinates of all corner points. smallest x-value ( x, y ) = 0, 160 ( x, y ) = 75, 60 largest x-value ( x , y ) = 150, 0 The minimum value of c occurs at which corner point? (x, y) = |0, 160 x State the minimum value of c. C = 320000 X How many of each model should the school buy to keep the cost as low as possible? Pomegranate * computers iZac 160 X computers 389