TOPIC: LINEAR PROGRAMMING 1.) List the corner points for the collection of constraints of a linear programming problem. Choices: a.,(3 0), (10, 0). (0, 4), (0, 0). (0, 8), and (8, 10) X510 5.3(, 0). (10 ,0), (0.4), (0, 8), and(10,8) Y 58 c. (4, 0). (8. 0), (0, 3), (0 10),and (10,8) 4x+ By; 12 d. (3 0). (10, 0) (0.4). (0, 8), and (8. 10) x20 e. (3, 0), (8, 0), (0, 4), (0. 10),and(8, 10) y 20 2.) List the corner points for the following collection of constraints of a linear programming problem. Choices: X S 13 a. (0, 4), (0, 24), (13, 0) b. (0, 0), (8, 0), (0, 13) 4X + 53' 2 24 c. (0, 0), (0.4), (13, 0) x 2 0 d-(010)!(510)1(13-0) y 220 e. (0, 4). (8, 0), (13, 0) 3.) List the corner points for the following collection of constraints of a linear programming problem. Choices: a.(0 0(_.),)8,)014(914(5,)(514) \"55 40.1 01..)01811214)15. 015. 0) V514 c.,,,1(00)(140)(2 4,)(5 8()05) 6x+3ys54 d(00)014 (21 ()5 850)(, X20 (,,82014)(01)(145)(,8),(514) yaO 4.) Mike's Toy Truck Company manufactures two models of toy trucks. a standard model and a deluxe model. Each standard model requires 2 hours for painting and 6 hours for detail work; each deluxe model requires 4 hours for painting and 5 hours for detail work. Two painters and three detail workers are employed by the company, and each works 40 hours per week Using x to denote the number of standard model trucks and y to denote the number of deluxe model trucks, write a system of linear inequalities that describes the possible number of each model of truck that can be manufactured in a week. Choices: , , d, e. 21+4ys 2x+6y5120 2x+6y580 8- J2x+4v580 '31 2x+6y580 54+5V=12 4x+5y580 4X+5vs120 16x+5y5120 {dx+5y