3. Solve the following mixed integer programming problem by branch and bound. You must show your tableaus and branch & bound tree. Maximizez=x1+4x2s.t.x1+2x23x1,x20x2integer ANSWER (a) (10 points) Does the problem have feasible points? Circle one. Yes No (b) (5 points) Does the problem have a solution? Circle one. Yes No. (c) (10 points) If you circled YES to (c), the maximum (x1,x2)= and the maximum objective function value = If you circled NO to (c), put NA in the blanks