2. (10 pts.) Bonbon can manufacture three types of candy bars. Let's suppose that (x/s representing the number of type i candy bar manufactured) you formulate the following LP for Bonbon: max z = 3 x1 + 7 X2 + 5 X3 s.t. X1 + X2+ x3 s 50 (Sugar constraint) 2 x1 + 3 x2 + x3 s 100 (Chocolate constraint) X1, X2, X3 2 0 Solve the LP model using Lindo software. Provide the formulation and the results. Comment on results