Please show all work

01. 145 points Partially solve the IP model graphically (for t=1 and t2, only) by using the Branch-and-Bound Method (Use a graph paper or other graphing sheet but be sure to implement a reasonable scale). Show the feasible region, and plot the objective function through the optimal point as a dashed line (- - -) for each subproblem solution. Indicate the optimal values of the variables and objective function for each subproblem solution and indicate all additional constraints, as shown below. When you need to branch, branch on X, first if there are two choices. Indicate all additional constraints from t=1 to create the subproblems and all additional constraints from t-2 to create the subproblems. Maximize Z = 2x2 + 3x2 Subject to: 4x + 2x2 2x + 5x2 X, X2 V VAI 15 (C1) 20 (C2) 0, X1, x2 integer For t-1, show the results: (X1, X2) - Z All constraints added to El to create subproblems: Constraint added to t=1 to create t2: For t2, show the results: (X1, X2) Z= All constraints added to t-2 to create subproblems