Solve the below:
Q: The manager of a food processing plant that specializes in potato chips has developed an LP model to reflect processing times.
x_1 = boxes of regular chips
x_2 = boxes of crinkle cut chips
maximize Z = 40x_1 + 30x_2 (profit)
subject to
Cutting 36x1+0.8x2<=144 minutes
Frying 3.2x1+1.6x2<=160 minutes
Packing 4.8x1+7.2 x2<=576 seconds
Crinkle x2<=80 boxes
Crinkle x2>=20 boxes
x1,x2>=0
Determine the combination of boxes of the two types of chips that will maximize profits. Is any constraint redundant? Explain briefly.