(a) Transform the problem into an equivalent LP in standard form by adding three slack variables, one for cach inequality constraint in the original model. Spell out the details of the model in standard form: objective function, functional constraints, and nonnegativity constraints. Observe that the problem is now also in canonical form. Write down the corresponding basic feasible solution, and clearly indicate which variables are basic and which are nonbasic. (b) Put the model into objective constraint form and implement the simplex algorithm. Be sure to explain carefully each step of the process: test for termination, entering and leaving variables, and each new basic feasible solution.