wat M Gmail YouTube 23 Maps 3 MY FREE MP3 Consider the following LP Maximise 8x + 11 y subject to 82 +13 y < 234 10:+8 y 3210 * 0,30 Determine the feasible corner point solutions, the value of the objective at each corner point solution and hence solve the LP Note: You need to enter the corner feasible solutions in order of increasing r. That is, the CPF 1 point will have the smallest 3-coordinate, while the CPF 3 point will have the largest x-coordinate: x-coordinate y-coordinate Objective value Maximum ? CPF1 CPF 2 CPF 3