If the optimal point on a linear programming graph lies at the intersection of the secondary department constraint and demand for product S constraint (equations from the constraints detailed below). Using simultaneous equations to resolve, which of A,B,C or D is the correct answer for the optimal solution: P=43.75S=120P=44S=125P=43.75S=125P=125S=43.75