Problem $3(10$ points$).$ Given a primal problem

min,$x_1+2x_2$

subject $to{x}_1-x_{2}10$

$,x_1+x_{2}20$

$,x_1,x_{2}0.$

Note that $(x_1=10,x_2=0)is$ feasible, can you give $an$ upper bound $on$ the difference between the objective

value $of$ this feasible solution and the optimal objective value using the dual problem?