Consider the following constraints from a two$-$variable Linear Program.

$(1)$ X $0$

$(2)$ Y $0$

$(3)5$X $+4$Y $50$

$(4)5$X $-2$Y $20$

If constraints $(3)$ and $(4)$ are binding, what is the optimal solution $($X$,$ Y$)?$

Group of answer choices

not enough information is provided to answer the problem

$(20,0)$

$(6,5)$

$(0,20)$

$(9,5)$