Consider the following LP problem with two constraints: 14X + 8Y >= 112 and 5X + 3Y >= 15. The objective function is Max 18X + 35Y. What combination of X and Y will yield the optimum solution for this problem? a. infeasible problem lag b. unbounded problem O c. 3.0 d. 0,5 O e. 1.3.33333 Customers arrive at a video rental desk at the rate of 8 per minute(Poisson).Each server can handle 2.667 customers per minute(Poisson). There are 7 servers in the system. What is the probability of 8 customers in the system? O a. 0.963 Ob. 0.017 O c. 0.009 O d. 0.05 O e. 0.009 Customers arrive at a video rental desk at the rate of 7 per minute(Poisson).Each server can handle 2.334 customers per minute(Poisson). If there are 4 servers, determine the probability of 3 or fewer customers in the system. O a. 0.491 Ob. 0. 127 O c. 0.038 O d. 0.062