2. (20 pts) This problem concerns the following linear program: Minimize Subject to 7x1 8x2 + 20x3 + 6x4 + 14x5 + 20x6 x1 + x2 + 204 + 2x5 9 2x1 - x2 + 3x3 + 4x5 + 3x6 = 11 X1,...,x6 > 0 a) Show how this LP can be rewritten into our standard computational form. You will have to add slack and surplus variables. b). An implementation of the simplex method has found an optimal solution to this LP to be given by x* = (x*1,x*2,8*3,x*4,8*5,x*) = (0,5,0,0,4,0). By determining the appropriate values for the slack and surplus variables, convert this to a solution to the LP you wrote in part (a). Determine which are the basic variables and write out the corresponding basis matrix. 2. (20 pts) This problem concerns the following linear program: Minimize Subject to 7x1 8x2 + 20x3 + 6x4 + 14x5 + 20x6 x1 + x2 + 204 + 2x5 9 2x1 - x2 + 3x3 + 4x5 + 3x6 = 11 X1,...,x6 > 0 a) Show how this LP can be rewritten into our standard computational form. You will have to add slack and surplus variables. b). An implementation of the simplex method has found an optimal solution to this LP to be given by x* = (x*1,x*2,8*3,x*4,8*5,x*) = (0,5,0,0,4,0). By determining the appropriate values for the slack and surplus variables, convert this to a solution to the LP you wrote in part (a). Determine which are the basic variables and write out the corresponding basis matrix