Use the BIP branch$-$and$-$bound algorithm to solve this BIP model interactively. The BIP model is in the photo. The optimal solution is already in the photo. But what I need is a binary integer programming $($BIP$)$ branch and bound algorithm with the steps. Also the problem has already been formed into a BIP model.

Objective Function:

Maximize

$Z=y_{11}+2y_{12}+5y_{21}+10y_{22}$

Subject to the Constraints:

$(y_{11}+2y_{12})+(10y_{21}+20y_{22})20$

$y_{11}+2y_{12}2$

$y_{ij}in\{0,1\},$ for $i=1,2$ and $j=1,2$

Optimal Solution

The optimal solution is:

$(y_{11},y_{12},y_{21},y_{22})=(0,0,0,1),$ with $Z=10$