use the M method to solve the following linear programming problem:
Minimize C+ -5x+10x+15x
Subject to 2x+3x+x <(or equal to) 24
x-2x-2x >(or equal to) 1
x,,x,x>(and equal to) 0
Minimize C+ -5x+10x+15x
Subject to 2x+3x+x <(or equal to) 24
x-2x-2x >(or equal to) 1
x,,x,x>(and equal to) 0