Discrete math: Simplex Method algorithm

2. A manufacturer produces three models of bicycles. The time (in hours) required for assembling, painting, and packaging each model is as follows Mo Model B Mo Assembly Painting Packaging 2.5 3 1.5 1.25 0.75 The total time available for assembling, painting, and packaging is 6004 hours, 2695 hours and 1500 hours, respectively The profit per unit for each model is $45 (Model A), S60 (Model B), and $55 (Model C). How many of each type should be produced to obtain a maximum profit? Use the simplex method and check your solution using the Maximize function in Mathematica. Include your code