operation research, dont use exel and with explenation please.

6. Consider the following linear program MaximizeSubjectto5x1+2x2x1+x2x1,x2z=5x1+3x23x1+5x215102x22.50 - Show the equality form of model. - Sketch the graph of the feasible region and identify the extreme point solutions. From this representation, find the optimal solution. - Analytically determine all solutions that derive from the intersection of two constraints or non negativity restrictions. Identify whether or not these solutions are feasible, and indicate the corresponding objective function values. Which one is optimal? - Let the slack variables fort he first two constraints, call them x3 and x4, be the axes of the graph, sketch the geometric representation of the model. Show an objective isovalve contour in these variables, and determine the optimal solution