A Simple Maximization Problem (15 Points) Consider the following linear programming problem a. List all the extreme points of the feasible region. b. Find the optimal solution and the objective function value. c. List the values of all the slack variables. a. (0,0),(6,0),(6,4),(2,5),(0,6); b. x=6,y=4,OFV=74; c. s1=40,s2=0,s3=0. a. (0,0),(6,0),(4,3),(2,5),(0,9); b. x=0,y=9,OFV=72; c. s1=0,s2=30,s3=2. a. (0,0),(4,0),(4,3),(2,5),(0,4); b. x=2,y=5,OFV=54; c. s1=10,s2=0,s3=0. a. (0,0),(6,0),(4,3),(3,5),(0,6);b.x=3,y=5,OFV=61;c.s1=5,s2=0,s3=0. a. (0,0),(6,0),(4,3),(5,5),(0,6);b.x=5,y=5,OFV=75; c. s1=35,s2=15,s3=5. a. (0,0),(7,0),(4,3),(2,5),(0,7); b. x=0,y=7,OFV=56; c. s1=20,s2=10,s3=0. a. (0,0),(6,0),(4,3),(2,5),(0,6); b. x=2,y=5,OFV=54; c. s1=10,s2=0,s3=0. a. (0,0),(7,0),(4,3),(2,5),(0,7); b. x=0,y=7,OFV=56; c. s1=20,s2=10,s3=0 a. (0,0),(6,0),(4,3),(2,5),(0,6); b. x=2,y=5,OFV=54; c. s1=10,s2=0,s3=0. a. (0,0),(6,0),(4,3),(3,4.5),(0,6); b. x=3,y=4.5,OFV=57; c. s1=0,s2=0, s3=0.5. a. (0,0),(6,0),(4,6),(2,5),(0,6); b. x=4,y=6,OFV=76; c. s1=10,s2=0,s3=0. a. (0,0),(12,0),(4,3),(2,5),(0,6);b.x=2,y=5,OFV=84;c.s1=90,s2=0,s3=5