he following questions below apply to the linear program minimize z = 101x1 + 87x2 + 23x3 subject to 6x1 13x2 3x3 11 6x1 + 11x2 + 2x3 45 x1 + 5x2 + x3 12 x1, x2, x3 0 with optimal basic solution basic x1 x2 x3 x3 x4 x5 rhs z 0 0 0 12 4 5 372 x1 1 0 0 1 2 7 5 x2 0 1 0 4 9 30 1 x3 0 0 1 19 43 144 2(ii) By how much can the right-hand side of the second constraint increase and decrease without changing the optimal basis?