1. Consider the product mix problem in which each of three products is processed on three different operations. The limits on the available time for the three operations are 430, 460, and 420 minutes daily and the profits per unit of the products are birr 3, 2, and 5. The time in minutes per unit on the three operations are given in the table below: Operations 123 Products Product 1 1 3 31 Product 2 2 0 2 Required: 1. Model the linear Programming? 2. Obtain the optimal solution using simplex method? Product 3 1 2 0