Solve the linear program below using graphical methods (either the extreme point or iso-profit line methods). When entering your answers, specify the *optimal solution* as a "point", i.e. enter coordinates X and Y as (X, Y). When entering a range (i.e. range of optimality or range of feasibility):

1. Use square brackets when the endpoint is included (all values except infinity) 2. Use parenthesis when the endpoint is *not* included. 3. Use -inf and inf to represent values of minus infinity and infinity respectively.

For example, if the lower endpoint is 5 and the upper endpoint is 7.25, you would enter [5, 7.25]. If the lower endpoint is minus infinity and the upper endpoint is 1.65, you would enter (-inf, 1.65].

If the linear program cannot be solved, specify one of the following for the optimal value and specify 0 for all other answers:

1 - Solution is suboptimal 2 - Empty feasible region 3 - Unbounded feasible region 4 - All other reasons

Enter all values to two decimal places.

Please share steps

min14.41X1+19.3X2 s.t. 14.04X1+3.92X2>=57 11.08X1+2.86X2>=59 5.03X1+1.82X2>=34 11.51X1+6.28X2=0