4. For the following integer programming model, the solution to its linear relaxation is given as follows: (z=14.5,x1=1,x2=0,x3=1,x4=0.5) Apply branch and bound algorithm, and using the solution to its relaxation branch it once. You don't need to create the whole tree. Show the linear relaxation, each step and your reasoning clearly (20 points) maxz=8x1+4x2+5x3+3x4st5x1+4x2+3x3+2x49xi=0or1 4. For the following integer programming model, the solution to its linear relaxation is given as follows: (z=14.5,x1=1,x2=0,x3=1,x4=0.5) Apply branch and bound algorithm, and using the solution to its relaxation branch it once. You don't need to create the whole tree. Show the linear relaxation, each step and your reasoning clearly (20 points) maxz=8x1+4x2+5x3+3x4st5x1+4x2+3x3+2x49xi=0or1