The information in the following table is for a simplex method of linear programming. Product $10 C $8 bat Scutting Sfinishing RHS mix Hokey $0 Scutting 2 1 1 0 16 $0 Sfinishing 1 2 0 1 14 Z $0 $0 $0 $0 $0 Cj-zi $10 $8 $0 $0 the objective function using simplex method is $10H+$123 the constraint in cutting using simplex method is 2H+1B+1*Slack (cutting)+0*Slack (finishing) =16 the constraint in finishing using simplex method is 1A+2B=16 ) the pivot column is not Bat column the replacement row is Slack (finishing) row 0 the value of the pivot coefficient (intersectional element) in the replacement row is 2. n the new value that replaced the pivot coefficient in the replacement row is 1. the new value that replaced the coefficient in Bat column in the replacement row is not 0.5. U O the new value that replaced the coefficient in Slack (finishing) column in the replacement row is 0.175. the new value for the right hand side of Zj is not 80