Cutting planes add constraints; B&B lower bounds never decrease

Consider the statements: 1. The use of cutting-plane method reduces the number of constraints in the given problem. 2. In a Branch and Bound minimization tree, the lower bounds on objective function value do not decrease in value. 3. The 0-1 integer programming problem requires the decision variables to have values between zero and one. Which of the above are correct?