Consider a candidate problem (i.e., current solution) somewhere in the Branch-and-Bound tree, specified by x3=2, and x61 for the following Integer Programming problem Minimize10x1+12x2+12x3+12x4+2x5+10x610x1+12x2+9x3+8x4+x5+4x665xjInteger (a) [5 points] Solve the LP relaxation at this node (i.e., x3=2, and x61 ). (b) [5 points] Branch at one of the non-integer solutions of part(a), and solve the resulting two problems