Suppose that a mathematical model fits linear programming except for the restrictions that 1. At least one of the following two inequalities holds:

x1 x2 x3 x4  4 3x1  x2  x3 x4  3.

2. At least two of the following four inequalities holds:

5x1 3x2 3x3  x4  10 2x1 5x2  x3 3x4  10

x1 3x2 5x3 3x4  10 3x1  x2 3x3 5x4  10.

Show how to reformulate these restrictions to fit an MIP model.