Problem #2 (20 points) - Dual Variables and the Simplex Tableau Consider the primal LP (Objective Function) (Constraints #1 through #111) (Sign Restrictions #1 though #71) (Objective Function) (Constraints #1 through #n) (Sign Restrictions #1 though #m) In class, it was stated that the entries under the primal's excess variables (call them e) in Row #0 (the objective row) of a simplex tableau contains the values of the dual's decision variables (p) while the entries under the primal's decision variables (x) in Row #0 of a simplex tableau contains the values of the dual's slack variables (call them 5). In this problem, you want to prove this statement using (without any lost in generally) the primal/ dual pair above. Hint: First place each of the LP problems in standard form, and then start with the expression for reduced costs in the primal LP