Consider the following linear programming problem: Max z =10x1 + 8x2 Its optimal solution is given by the Subject to: following inverse Matrix: 5x1 + 2x2 518 1/6 0 -1/121 8x7 +4x2 210 1/12 0 5/24 - 2x, +4x2 s12 . 5/3 -1 1/6 X1,4220 Where x1, x2 and x3 are basic variables. Where x1, x2 and x3 (surplus) are basic variables, representing the first, second, and third constrains, respectively. s1 (Eq. 1), R (Eq.2), and s2 (Eq. 3) are non-basic variables. Determine the range of change for the THIRD (D3) resource to which the above LP problem remains feasible. -134