Please see tutorials for the Excel Solver. Answer the following with complete process.

Consider the following linear program: Maximize 5A + 38 + 2C Subject to: Constraint 1: -A + 38 - C $ 15 Constraint 2: 2A + 38 - 20 5 20 Constraint 3: 3A - 28 + 40 % 45 Constraint 4: -3A + 28 + C 2 10 Constraint 5: BA - B - C 2 25 Constraint 6: A - B + 30 2 30 A, B, C20 1. What is the optimal value of the objective function? Round off to the nearest ones digit. 53 b. 87 C. 78 d. 97 2. Which constraints are binding? 1 1,2,4 b. 2,3,5 6 3.5,6 d. 1, 4.6 3. Since we know that this linear program has a finite feasible optimal objective function value, what conclusion can we draw about the dual optimal objective function value? a. The dual optimal is greater than or equal to the primal optimal b. The dual optimal is less than or equal to the primal optimal C. The dual optimal is equal to the primal optimal d. The dual optimal may or may not exist 4. Using the dual variables pi to p. to correspond to the primal constraints, which of the following is a valid constraint to the dual problem? Use the conversion table shared in class based on Taha. Do not do any substitutions yet. a. .P1 + 2pz+ 3p;+ 3p. - 8p, - P. 25 b. 3p1 + 3p1 - 2p3 + 2p. . ps + p.23 C. .P1 - 2pz + 4p1 + P. - Ps + 3p. 2 2 d. -pi + 2pz + 3ps - 3p. + 8p: + p. $5 5. Which of these variables are basic (Le, non-zero] in the dual? b. pa. pi. Ps C. pups, Pa d. pu Po Po 6. How many variables would require a substitution to standardize the dual problem? a. F C