Consider the following linear program: Min Z = 2*x + 3*y subject to 3*x + 4*y 2 12 3*x + 2*y 29 ys1 x, y20 This problem has no feasible solutions. has three feasible corner points. has an optimal solution at (x, y) = (3,0). has a feasible corner point at (x, y) = (2.67, 1) Exactly two of the other answers are correct. KAB Cycle produces two models bike the Racer (R) and the Stinger (S) and wishes to maximize weekly profit. Each R bike has a unit profit of $70, and the unit profit of each S bike is $40. KAB Cycle assembles and the finishes the bikes. Each R bike model takes 2 hours for assembly and 2 hours for finishing. The times for an S bike are 1 and 3 hours for assembly and finishing, respectively. There are 90 hours available per week in assembly and 130 hours in finishing. KAB is limited to producing 50 bikes in total per week. Which of the following is not a constraint for the KAB Cycle linear program? 1 R + 1'S s 50 2R+1*5 = 90 2R+3*5 = 130 1*R+ 1'S 20 None of the other answers are correct