Given the following linear programming problem, solve it through the graphical method and fill in the blanks. IMPORTANT: Use values with up to 2 decimal places when they are more than two leg3.75, 2.45, 56.-), with elements of only one decimal place, use only that decimal (eg 2.5 and not 2.50), integer values use the integer value (35 and not 35.0). Max Z = 3X1 + 6X2 St X1-2X2 = 2 2X1 + 3X2> = 6 X1, X2>= 0 The feasible solution space contains a total of feasible end points of solution. The optimal solution of Z in the problem is , where X1 is equal to and X2 is equal to Another of the extreme points of the feasible solution space is the point (2,2 / 3) (write yes = correct, no = incorrect) as well as the point (2,3/2) (write if = correct, = incorrect) ; in the same way the point (4,0) is feasible (write if = correct, no = incorrect) and the point (3,0) (write yes = correct, no = incorrect)