l. Consider the following linear programming problem. Maximize : P = 120xt 100g S47 34 2,15 Subject to i x = 0 Ta Determine the feasible region (polygon, b) Find all the corner points (verticles) on the graph and indicate if the point are in the feasible region. c) Complete the following table Basic Solutions Intersection Pant? feasible region d) Find (Evaluate feasible the maximum value P only at the points region). of P that ar Corner point P = 100x + 100y Soi