(c) Graph the feasible set. Determine the vertices of the feasible set. (d) Use the Fundamental Theorem of Linear Programming to determine optimal point. Interpret the result. 2. UGotPants makes blue jeans in two styles, boot cut and comfort fit. The boot cut jeans take 20 minutes of cutting time and 30 minutes of sewing time, generating a profit of $12, while the comfort fit jeans take 35 minutes of cutting time and 25 minutes of sewing time, generating a profit of $16. Each day, the plant has available 2100 minutes of cutting time, and 2400 minutes of sewing time. How many boot cut and comfort fit jeans must be made to maximize profit? (a) Create a chart or table to organize the information. (b) Formulate a complete linear programming