Consider the linear program: Maximize Subject to. 2x2 - 5x3 x + + X3 2x + x2 + 6x3 x - x2 + 3x3 x20 for i = 1,...5 X4 = 2 + x3 = 6 = 0 0 0 Suppose you are told that a feasible basis is B = [x2x5x|= 1 1 2 a) Compute the basic feasible solution XB = (x2, X5, X) corresponding to this basis. b) Compute the simplex tableau corresponding to this basis. c) Identify an entering variable and an exiting variable (if there are any) and compute the new tableau by pivoting. d) What is the new basis corresponding to your new tableau? e) Is the new solution optimal? Why?