plot on graph and show all work clearly please!

(a) [50] Provide the graphical solution of the following LP. (Use the provided graph sheet or other graphing sheet but be sure to implement a reasonable scale). Identify the feasible region and the optimal solution. Plot the objective function as a double dashed line (====:) through the optimal point. Label the feasible extreme points starting with [X1,X2]=[0,0] as A, and continuing clockwise through G. (b) [20] Augment the constraint set with slack/surplus variables - as required - using the assigned slack/surplus variables. Write out the full (augmented) linear program. (c) [50] What is the A matrix? What is the Right Hand Side (RHS) Vector, b? What is the maximum number of extreme points for this LP? (d) [150] Solve the augmented linear program via the Simplex Method Using the DICTIONARY approach described in class. Clearly identify each iteration and include the SIMPLIFIED dictionary. Provide the value of the objective function, and the values of ALL the variables at each iteration. IMPORTANT: At each iteration, always choose the variable with the lowest subscript when more than one variable could be made Basic. For example, if X3 and X5 can be made Basic, choose X3. Be careful to follow this requirement-otherwise you will loose points since you will NOT be solving the problem with the IMPOSED requirements. (e) [20] In the implementation of the procedure, explain your reasoning when terminating the process. In other words, why do you think the solution you obtained is optimal? (f) [30] Characterize the optimal solution of (c) as one of the following: (i) Unique Optimal; (ii) Alternate Optima. You must state the REASON for your characterization. No reason, no credit. (g) [30] On the graph of Problem [a], show the progression from the initial feasible solution toward the optimal solution. (h) [50] For each FEASIBLE Extreme Point in Problem (a), Complete the following table (add additional rows as needed): (a) [50] Provide the graphical solution of the following LP. (Use the provided graph sheet or other graphing sheet but be sure to implement a reasonable scale). Identify the feasible region and the optimal solution. Plot the objective function as a double dashed line (====:) through the optimal point. Label the feasible extreme points starting with [X1,X2]=[0,0] as A, and continuing clockwise through G. (b) [20] Augment the constraint set with slack/surplus variables - as required - using the assigned slack/surplus variables. Write out the full (augmented) linear program. (c) [50] What is the A matrix? What is the Right Hand Side (RHS) Vector, b? What is the maximum number of extreme points for this LP? (d) [150] Solve the augmented linear program via the Simplex Method Using the DICTIONARY approach described in class. Clearly identify each iteration and include the SIMPLIFIED dictionary. Provide the value of the objective function, and the values of ALL the variables at each iteration. IMPORTANT: At each iteration, always choose the variable with the lowest subscript when more than one variable could be made Basic. For example, if X3 and X5 can be made Basic, choose X3. Be careful to follow this requirement-otherwise you will loose points since you will NOT be solving the problem with the IMPOSED requirements. (e) [20] In the implementation of the procedure, explain your reasoning when terminating the process. In other words, why do you think the solution you obtained is optimal? (f) [30] Characterize the optimal solution of (c) as one of the following: (i) Unique Optimal; (ii) Alternate Optima. You must state the REASON for your characterization. No reason, no credit. (g) [30] On the graph of Problem [a], show the progression from the initial feasible solution toward the optimal solution. (h) [50] For each FEASIBLE Extreme Point in Problem (a), Complete the following table (add additional rows as needed)