the following LP (Linear Programming) by graphical method . (hint: find the feasible region first, then the optimal solution should be one of the corners/extreme points. For portraying the constraint 3x_1-x_2<=30, we only have to do the same trick I showed in the class, that is finding two points on the line 3x_1-x_2=30. First, we let x1=13.33 (40/3), then we get x2= 10; second we let x2=0, then we get x1=10. By connecting the two points (13.33, 10) and (10, 0), we can portray the cutting line for the constraints 3x_1-x_230.) Max10x_1 3x_2 s.t. {(x_210@3x_1 4x_260@3x_1-x_230@x_1,x_20) You are encouraged to complete this question by Word. However, you can also complete this question with handwriting. If you want to do so, please scan your handwriting and submit as a PDF file