A Linear programming problem has the following three constraints: $16$X $+16$Y $<=256$; $9$X $+15$Y$=135$; and $16$X $-$ Y $<=74.$ The objective function is Min $19$X $+25$Y $.$ What combination of X and Y will yield the optimum solution for this problem?

a$.$

$5,6$

b$.$

$15,0$

c$.$

$0,9$

d$.$

infeasible problem

e$.$

unbounded problem