A) A Linear programming problem has the following three constraints: 33X + 28Y <= 924; 20X + 15Y = 300; and 10X - Y <= 116. The objective function is Min 20X + 23Y. What combination of X and Y will yield the optimum solution for this problem?
a. infeasible problem
b. 0, 20
c. 15, 0
d. 12, 4
e. unbounded problem
B) Passengers arrive at the immigration counter at a rate of one every 4 minutes, and processing their documents takes an average of 10 minutes each. There are 3 employees on duty. If a passenger isn't served immediately, how long on average would the passenger have to wait for service?
a. 20 minutes
b. 25 minutes
c. 4.555 minutes
d. 10 minutes