Consider the following optimal tableau for a linear programming problem where the constraints of the original problem were all $$ with non$-$negative righthand side values. $($So the initial basic variables were the slack variables in order$)$

The original objective function is $21+32+43+54$

$\backslash$table$[[z,x_1,x_2,x_3,x_4,s_1,s_2,s_3,s_4,$RHS$],[1,a,5,c,1,d,g,6,6,50],[0,0,1,1,1,0,0,1,1,10],[0,0,-1,0,-1,0,1,1,1,0],[0,0,1,0,1,e,0,1,1,6],[0,b,2,0,1,f,0,1,1,h$