MinimizeZ=3x1+2x2Subjectto5x1+x210x1+x26,x1+4x212x1,x20 a) Show the feasible region (feasible solution space) in (x1,x2) space. Solve the problem gcometrically. Find and show the optimum point and optimum objective value. You should show the objective functions where objective value is same and show the direction of objective function. You should also show the intersection of objective function with extreme point at optimum point on your graph. ( 15p) b) Determine the number of all basic solutions of the problem. Then find the basic solution when 1,2 and the surplus variable which is used in the third constraint are in the basis