Suppose we are solving a maximization linear program, and we arrive at the following simplex tableau in which some numbers have been replaced by constants p and q. z x1 x2 x3 x4 x5 RHS Row 0 1 0 0 p q 0 105 Row 1 0 0 1 0 2 0 42 Row 2 0 0 0 -2 1 1 39 Row 3 0 1 0 -3 -2 0 6 Suppose you enter x3, which will move you in a certain direction from the current basic feasible solution. By moving in this direction, it is possible to compute a feasible solution with objective value 105 - 2p. For this solution, what is the value of x5