Similar to the lecture, carry the Branch and Bound algorithm on the following IP optimization

problem. Indicate in detail the predecessor problem, the successor subproblems you formulate,

and their feasible$/$infeasible optimal solution.

Maximize

x$,$y in Z $4$x $+5$y

subject to x $+4$y $<=10$

$3$x $4$y $<=6$

x$,$ y $>=0$