Consider the following linear programming model:

maximize $2x_1+x_2$

subject $to{x}_{2}10$

$,2x_1+5x_{2}60$

$,x_1+x_{2}18$

$,3x_1+x_{2}44$

$,x_{1}0,x_{2}0$

Categorize the following solutions, given in the form $(x_1,x_2),$ as feasible or infeasible:

$(0,0)$

$(15,1)$

$(-1,-2)$

$(2,10)$

$(14,2)$