The cafeteriaof a prominent university in Carson, California hires students to assist in its three shifts of operations: breakfast, lunch, and dinner. In order to provide good customer service, the cafeteria has a policy that the number of students hired for the lunchshift must exactly equal (no more and no less) to the combined total number of students hired for the other two (that is, breakfast AND dinner) shifts. Based on these information, if B is the numberof students hired for the breakfast shift, L is the number of students hired for the lunch shift, and D is the number of studentshiredfor the dinner shift, then the constraint used in a Linear Programming (LP) problem to describe this situation is

a.B =L +D

b.L=B +D

c.D =B +L

d.Not enough information given to answer this question