Please solve the following problem

Consider the following example Consider the following LP Model: Maximize z= 4x1 + 6x2 + 2x3 o Subject to X1 + 2x2 + 2x3 = 4 4x1 + 2x2 + 2x3 = 16 X1 + 4x2 + 3x3 = 9 O X; 20 1 The objective function equation in "standardized" form is written as * 4 points z + 4x1 + 6x2 + 2x3 = 0 None of the answers. 2 - 4x1 - 6x2 - 2x3 = 0 z + 4x1 - 6x2 - 2x3 = 0 Z - 4x1 + 6x2 + 2x3 = 0 2 Add/Subtract a slack/surplus variable to the 1st constraint * 4 points X1 + 2x2 + 2x3 + S1 = 4 x1 + 2x2 + 2x3 + S1 S 4 None of the answers. x1 + 2x2 + 2x3-S1 S4 x1 + 2x2 + 2x3-S1 = 4 3 Add/Subtract a slack/surplus variable to the 2nd constraint * 4 points 4x1 + 2x2 + 2x3 - S2 s 16 4x1 + 2x2 + 2x3-S2 = 16 4x1 + 2x2 + 2x3 + S2 s 16 4x1 + 2x2 + 2x3 + S2 = 16 None of the answers. Add/Subtract a slack/surplus variable to the 3rd constraint * 4 points x1 + 4x2 + 3x3 + S3 5 9 x1 + 4x2 + 3x3 + S3 = 9 x1 + 4x2 + 3x3 - S3 = 9 x1 + 4x2 + 3x3 - S3 = 9 5 is the "entering variable" since it has the 4 points X2; most negative coefficient X2; minimum positive coefficient X2; most positive coefficient X2; minimum positive ratio None of the answers. is the "leaving variable" since it has the/a 4 points O None of the answers. S1; minimum positive ratio S1; zero ratio S1; most positive ratio OO S1; most negative ratio 7 4 points The pivot element is the intersection of the & it's equal to Pivot column; pivot row; 4 Pivot column; pivot row; 1/2 O Pivot column; pivot row; 12 None of the answers. Pivot column; pivot row; 2 3 points The development of the simplex method computations is facilitated by imposing two requirements on the LP model: * Convert all inequalities to equations & all variables are negative. Convert all equations to inequalities & all variables are negative Convert all equations to inequalities & all variables are non-negative. Convert all inequalities to equations & all variables are non-negative