QUESTION 5 If the optimal point on a linear programming graph lies at the intersection of the constraints for departments F and G (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: Department F Department G S=50 T= 50 S=100 T 50 S=50 T = 100 S=100 T= 100 55 TE ++ 2T 100 150