3. The initial and nal tableaus of a linearprogramming problems are as follows: Initial Tableau Basic Current variables values x1 x2 x3 x4 x 5 xs 6 4 9 7 10 x6 4 l l 3 40 (z) 0 12 20 18 40 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: m Ej = 61' Zai: E 0, i=1 where the terms with bars refer to data in the nal tableau and the terms without bars refer to data in the initial tableau. Final Tableau Basic C urrem variables values 51 3 L 30 m 3 0) Verify the complementaryslackness conditions