Let (P) be the following linear model : Max z = 5x1 + 7x2 (1) Such as: 2x1 + 4x2 38 (2) 3x1 + 3x2 32 (3) x1 6 (4) x1, x2 0 (5) x1, x2 entiers. Solve the linear (P) model using the SEP method using the best cj (highest profit) criterion. Draw the tree obtained with the solution of each node (as in the Powerpoint). Identify the optimal solution. Use Excel's Solver to find the intermediate solutions and then validate the optimal solution including the integer constraints