BAK manufactures two products, AAA and BBB. Both products require two manufacturing steps: fabrication (FAB), and final assembly (FINAL). The hours per unit and the total amount of time available each week is provided in the table below. The profit for products AAA and BBB is $375 and $175 per unit, respectively. BAK must produce at least 90 units in total each week. The company seeks to determine the mix of products AAA and BBB that maximizes the profit.

Product	FAB (hours/unit)	FINAL (hours/unit)
AAA	3	2
BBB	2	1
Total Weekly Hours Available	240	140

Assume the symbols A and B represent the decision variables corresponding to products AAA and BBB, respectively. Which of the following statements are true for the BAK product mix optimization problem?

Group of answer choices:

If two points are feasible corner point solutions in any linear program, then any point on the line connecting these two solutions will be a feasible corner point solution.

Exactly two the answers are correct.

(A, B) = (0, 0) is a feasible solution for the BAK problem.

(A, B) = (40, 60) is a feasible corner point.

Both of the non-negativity constraints are redundant, that is, they are not needed for defining the feasible region.