Please write the answer on paper and step by step

Solve the following integer linear programming problem with the branch-and-bound algorithm using the graphical method to solve each of the subproblems. Minz=5x14x2s.t.x1+x2510x1+6x245x1,x20andintegers (1) Branch on the variable x2 at the root. (2) Browse the branching tree in depth, placing type constraints on the left and type constraints on the right, i.e