The initial and final tableaus of a linear-programming problems are as follows: Initial Tableau (1) Find the missing values in the initial tableau. Final Tableau (2) a) Find the optimal solution for the dual problem. b) Verify that the values of the shadow prices are the dual feasible, i.e., that they satisfy the following relationship: cj=cji=1maijyi0, where the terms with bars refer to data in the final tableau and the terms without bars refer to data in the initial tableau. c) Verify the complementary-slackness conditions