For the linear programming problem in Question $2,$ answer the following questions regarding solving

it with the simplex method.

a$)$ Develop the Canonical form for this problem.

b$)$ Identify the slack variables, an initial basic feasible $($BF$)$ solution $($including basic and nonbasic

variables$),$ and the value of the objection function. Finally, determine whether the current BF

solution is optimal and explain why$/$why not.

c$)$ Perform one iteration to proper form from Gaussian elimination complete with the minimum

ratio test, identification of the entering and leaving basic variable, and resulting values of both

the BF solution and the objective function.